On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- 1 June 1976
- journal article
- research article
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 14 (2), 139-143
- https://doi.org/10.1080/03155986.1976.11731633
Abstract
This paper considers the location of n departments on one line. These departments are of different lengths and the material ilow between each pair of departments is known. The objective is to minimize total transportation costs given by the sum of all distance-flow products. The distance between two departments is the separation between their centroids. A binary mixed integer programming formulation is presented to solve this problem. The formulation involves ½n(n – 1) binary variables. Computational results are presented.Keywords
This publication has 5 references indexed in Scilit:
- Practical Solution of Large Mixed Integer Programming Problems with UmpireManagement Science, 1974
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- Technical Note—A Further Note on One-Dimensional Space AllocationOperations Research, 1971
- One-Dimensional Space Allocation: An Ordering AlgorithmOperations Research, 1969
- Finite-State Processes and Dynamic ProgrammingSIAM Journal on Applied Mathematics, 1967