A nested partitions framework for solving large-scale multicommodity facility location problems
- 1 April 2004
- journal article
- Published by Springer Nature in Journal of Systems Science and Systems Engineering
- Vol. 13 (2) , 158-179
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problemEuropean Journal of Operational Research, 2000
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location ProblemINFOR: Information Systems and Operational Research, 1999
- Efficient Solution of a Multi‐commodity, Two‐stage Distribution Problem with Constraints on Assignment of Customers to Distribution CentresInternational Transactions in Operational Research, 1998
- The Logic of Logistics1997
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirementsAnnals of Operations Research, 1996
- A cross decomposition algorithm for a multiproduct-multitype facility location problemComputers & Operations Research, 1993
- Lagrangean heuristics for location problemsEuropean Journal of Operational Research, 1993
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source ConstraintsJournal of the Operational Research Society, 1986
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Multicommodity Distribution System Design by Benders DecompositionManagement Science, 1974