Solving capacitated facility location problems by Fenchel cutting planes

Journal of the Operational Research Society

Volumn 56, Issue 3, 2005, Pages 297-306

  Ramos, M T ^a   Saez J ^a  

^a UNIVERSITY OF VALLADOLID   (Spain)

Author keywords

Cutting planes; Heuristics; Integer programming; Location

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; HEURISTIC METHODS; INTEGER PROGRAMMING; INTEGRATION; LINEAR PROGRAMMING; LOCATION; OPTIMIZATION;

CAPACITED FACILITY LOCATION (CFL); CUTTING PLANES; FRENCHEL CUTTING PLANES; LAGRANGEAN DUAL;

PROBLEM SOLVING;

EID: 14944363326     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601810     Document Type: Article

References (34)

1. Daskin MS (1995). Network and Discrete Location. Wiley-Interscience: New York.
2. Sridharan R (1995). The capacitated plant location problem. Eur J Opl Res 87: 203-213.
3. Cornuèjols G, Sridharan R and Thizy JM (1991). A comparison of heuristics and relaxations for the capacitated plant location problem. Eur J Opl Res 50: 280-297.
4. Nauss RM (1978). An improved algorithm for the capacitated facility location problem. J Opl Res Soc 29: 1195-1201.
5. Beasley JE (1993). Lagrangean relaxation. In: Reeves CR (ed). Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, Oxford, pp. 243-304.
6. Wolsey LA (1998). Integer Programming. Wiley-Interscience: New York.
7. Shapiro JF (1979). A survey of Lagrangean techniques for discrete optimization. Ann Discrete Math 5: 113-138.
8. Fisher (1981). The Lagrangian relaxation method for solving integer programming problems. Mngt Science 27: 1-18.
9. Barceló J, Fernandez E and Jörnsten KO (1991). Computational results from a new lagrangean relaxation, algorithm for the capacitated plant location problem. Eur J Opl Res 53: 38-45.
10. Beasley JE (1993). Lagrangean heuristics for location problems. Eur J Opl Res 65: 383-399.
11. Sridharan R (1991). A Lagrangean heuristic for the capacitated plant location with side constraints. J Opl Res Soc 42: 579-585.
12. CPLEX (2000). ILOG CPLEX 7.0, Reference Manual. ILOG CPLEX Division: Incline Village, NV.
13. XPRESS (2002). Optimization Subroutine Library, Reference Manual 13. Dash Associates, Blisworth, UK.
14. Crowder HP, Johnson EL and Padberg MW (1983). Solving large-scale zero-one linear programming problems. Opns Res 31: 803-934.
15. Martin RK (1999). Large Scale Linear and Integer Optimization: A Unified Approach. Kluwer Academic Publishers: Massachusetts.
16. Johnson EL, Nemhauser GL and Savelsbergh MWP (2000). Progress in linear programming-based algorithms for integer programming: an exposition. INFORMS J Comput 12: 2-23.
17. Nemhauser GL and Wolsey LA (1988). Integer and Combinatorial Optimization. Wiley-Interscience: New York.
18. Aardal K, Pochet Y and Wolsey LA (1995). Capacitated facility location: valid inequalities and facets. Math Opns Res 20: 562-582.
19. Aardal K (1998). Capacitated facility location: separation algorithms and computational experience. Math Programm 81: 149-175.
20. Cho DC, Johnson EL, Padberg MW and Rao MR (1983). On the uncapacitated plant location problem. I: valid inequalites and facets. Math Opns Res 8: 579-589.
21. Cho DC, Padberg MW and Rao MR (1983). On the uncapacitated plant location problem. II: facets and lifting theorems. Math Opns Res 8: 590-612.
22. Leung JM and Magnanti TL (1989). Valid inequalities and facets of the capacitated plant location problem. Math Programm 44: 271-291.
23. Klose A and Drexl A (2000). Lower bounds for the capacitated facility location problem based on column generation. Working Paper 2000:09-00-03:2 Universitat St. Gallen: St. Gallen, Switzerland.
24. Sáez J (2000). Solving linear programming relaxations associated with lagrangean relaxations by Fenchel cutting planes. Eur J Opl Res 121: 609-626.
25. Boyd EA (1993). Generating Fenchel cutting planes for knapsack polyhedra. SIAM J Optim 3: 734-750.
26. Boyd EA (1993). Solving integer programs with cutting planes and preprocessing. Neural Parallel Sci Comput 1: 453-466.
27. Boyd EA (1994). Fenchel cutting planes for integer programming. Opns Res 42: 53-64.
28. Boyd EA (1995). On the convergence Fenchel cutting planes in mixed-integer programming. SIAM J Optim 5: 421-435.
29. Geoffrion AM (1974). Lagrangian relaxation and its uses in integer programming. Math Programm study 2: 82-114.
30. Shapiro JF (1979). Mathematical Programming: Structures and Algorithms. Wiley & Sons: New York.
31. Shapiro JF (1971). Generalized Lagrange multipliers in integer programming. Opns Res 19: 68-76.
32. Microsoft Visual C++ (1998). C++ Language Reference. Microsoft Corporation, USA.
33. Held M, Wolfe P and Crowder HP (1974). Validation of subgradient optimization. Math Programm 6: 62-88.
34. Martello S and Toth P (1990). Knapsack Problems. Wiley: Chichester.