Lagrangian relaxation for the star‐star concentrator location problem: Approximation algorithm and bounds
- 1 March 1985
- Vol. 15 (1) , 1-20
- https://doi.org/10.1002/net.3230150102
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- Large-Scale Network Topological OptimizationIEEE Transactions on Communications, 1977
- Validation of subgradient optimizationMathematical Programming, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- An Efficient Branch and Bound Algorithm for the Warehouse Location ProblemManagement Science, 1972
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- Duality in Nonlinear Programming: A Simplified Applications-Oriented DevelopmentSIAM Review, 1971
- A Branch-Bound Algorithm for Plant LocationOperations Research, 1966
- Warehouse Location Under Continuous Economies of ScaleManagement Science, 1966
- On teleprocessing system design, Part II: A method for approximating the optimal networkIBM Systems Journal, 1966