Upper and lower bounds for the single source capacitated location problem
- 1 December 2003
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 151 (2) , 333-351
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- An exact algorithm for the capacitated facility location problems with single sourcingEuropean Journal of Operational Research, 1999
- Efficient solution of large scale, single-source, capacitated plant location problemsJournal of the Operational Research Society, 1999
- Lagrangean heuristics applied to a variety of large capacitated plant location problemsJournal of the Operational Research Society, 1998
- A Lagrangian heuristic for the capacitated plant location problem with single source constraintsEuropean Journal of Operational Research, 1993
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- Lagrangian Relaxation and the Single-Source Capacitated Facility-Location ProblemJournal of the Operational Research Society, 1988
- Efficient algorithms for the capacitated concentrator location problemComputers & Operations Research, 1987
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source ConstraintsJournal of the Operational Research Society, 1986
- An Algorithm for the Fixed-Charge Assigning Users to Sources ProblemJournal of the Operational Research Society, 1983
- An Improved Algorithm for the Capacitated Facility Location ProblemJournal of the Operational Research Society, 1978