A direct dual method for the mixed plant location problem with some side constraints
- 1 December 1979
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 17 (1) , 198-228
- https://doi.org/10.1007/bf01588244
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- On the Uncapacitated Location ProblemPublished by Elsevier ,1977
- Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location ProblemPublished by Elsevier ,1977
- Validation of subgradient optimizationMathematical Programming, 1974
- Constructive Duality in Integer ProgrammingSIAM Journal on Applied Mathematics, 1974
- Experiments in the formulation of integer programming problemsPublished by Springer Nature ,1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- Canonical Cuts on the Unit HypercubeSIAM Journal on Applied Mathematics, 1972
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- An Out-of-Kilter Method for Minimal-Cost Flow ProblemsJournal of the Society for Industrial and Applied Mathematics, 1961
- Solving the Transportation ProblemManagement Science, 1956