A branch-and-price algorithm for the capacitated p-median problem

Networks

Volumn 45, Issue 3, 2005, Pages 125-142

  Ceselli, Alberto ^a   Righini, Giovanni ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Branch and price; Column generation; Integer programming; p median

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; GRAPH THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

BRANCH-AND-BOUND; BRANCH-AND-PRICE; COLUMN GENERATION; P-MEDAIN;

ALGORITHMS;

EID: 17644395624     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20059     Document Type: Article

References (28)

1. R. Baldacci, E. Hadjiconstantinou, V. Maniezzo, and A. Mingozzi, A new method for solving capacitated location problems based on a set partitioning approach, Comput Operat Res 29 (2002), 365-386.
2. J.E. Beasley, A note on solving large p-median problems, Eur J Operat Res 21 (1985), 270-273.
3. A. Ceselli, Algoritmi branch and bound e branch and price per il problema delle p-mediane con capacità (in Italian), Dipartimento di Technologie dell'Informazione, Università degli Studi di Milano, Master degree thesis 2002.
4. N. Christofides and J.E. Beasley, A tree search algorithm for the p-median problem, Eur J Operat Res 10(1981), 196-204.
5. G. Cornueojols, M.L. Fisher, and G.L. Nemhauser, Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms, Manage Sci 23 (1977), 789-810.
6. J.A. Diaz, and E. Fernández, A branch-and-price algorithm for the single source capacitated plant location problem, J Operat Res Soc 53 (2002), 728-740.
7. J.A. Diaz and E. Fernández, Hybrid scatter scatter search and path relinking for the capacitated p-median problem, Eur J of Operat Res, to appear.
8. J.J. Dongarra, Performance of various computers using standard linear equations software, Technical Report. University of Tennessee, 2003 (available at http://www.netlib.org/benchmark/performance.ps).
9. R.D. Galvão, A dual-bounded algorithm for the p-median problem, Operat Res 28 (1979), 5.
10. P.C. Gilmore and R.E. Gomory, A linear programming approach to the cutting stock problem, Operat Res 9 (1961), 849-859.
11. P. Hanjoul and D. Peeters, A comparison of two dual-based procedures for solving the p-median problem, Eur J Operat Res 20 (1985), 387-396.
12. M. Held, P. Wolfe, and H.P. Crowder, Validation of subgradient optimization, Mathe Program 6 (1974), 62-88.
13. K. Jörnsten and M. Näsberg, A new lagrangean relaxation approach to the generalized assignment problem, Eur J Operat Res 27 (1986), 313-323.
14. O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems. Part 2. The p-median., SIAM J App Math 37 (1979), 539-560.
15. R.M. Karp, "Reducibility among combinatorial problems," R.E. Miller, J.W. Thatcher (editors), Complexity of computer computations, Plumunu Press, New York 1972, pp. 85-103.
16. L. Lorena and E. Senne, A column generation approach to capacitated p-median problems, Compu and Operat Res 31 (2004), 863-876.
17. V. Maniezzo, A. Mingozzi, and R. Baldacci, A bionomic approach to the capacitated p-median problem, J of Heuristics 4 (1998), 263-280.
18. S. Martello and P. Toth, "An algorithm for the generalized assignment problem," Operational Research '81, J.P. Brans (editor), North-Holland, Amsterdam, (1981), pp. 589-603.
19. S. Martello and P. Toth, Knapsack problems - Algorithms and computer implementations, John Wiley and Sons, New York, 1989.
20. J.M. Mulvey and P. Beck, Solving capacitated clustering problems, Eur J Operat Res 18 (1984), 339-348.
21. S.C. Narula, U.I. Ogbu, and H.M. Samuelsson, An algorithm for the p-median problem, Operat Res 25 (1977), 4.
22. M. Labbé, D. Peelers, and J.F. Thisse, "Location on networks, in network routing," Handbooks in OR and MS, Elsevier Science B.V., Amsterdam, 1995, vol 8.
23. G.L. Nemhauser and L.A. Wolsey, Integer and combinatorial optimization, Wiley-Interscience, New York, 1988.
24. I.H. Osman and N. Christofides, Capacitated clustering problems by hybrid Simulated annealing and tabu search, Int Trans Operat Res 13 (1994), 317-336.
25. H. Pirkul, Efficient algorithms for the capacitated concentrator location problem, Comput Operat Res 14 (1987), 197-208.
26. D. Pisinger, A minimal algorithm for the 0-1 knapsack problem, Operat Res 46 (1995), 758-767.
27. G.T. Ross and R.M. Soland, Modeling facility location problems as generalized assignment problems, Manage Sci 24 (1977), 3.
28. M. Savelsbergh, A branch-and-price algorithm for the generalized assignment problem, Operat Res 45 (1997), 6.