Solving Fixed Charge Location-Allocation Problems with Capacity and Configuration Constraints
- 1 December 1971
- journal article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 3 (4), 290-298
- https://doi.org/10.1080/05695557108974818
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A branch‐bound algorithm for the capacitated facilities location problemNaval Research Logistics Quarterly, 1969
- A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge ProblemsManagement Science, 1969
- An Improved Implicit Enumeration Approach for Integer ProgrammingOperations Research, 1969
- A Dynamic Programming Algorithm for Facility Location and AllocationA I I E Transactions, 1969
- A Branch-Bound Algorithm for Plant LocationOperations Research, 1966
- Warehouse Location Under Continuous Economies of ScaleManagement Science, 1966
- An Application of Heuristic Problem Solving to Accounts Receivable ManagementManagement Science, 1966
- Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)Operations Research, 1964
- A Heuristic Program for Locating WarehousesManagement Science, 1963
- An Out-of-Kilter Method for Minimal-Cost Flow ProblemsJournal of the Society for Industrial and Applied Mathematics, 1961