A Branch-and-Cut Algorithm for the Single-Commodity, Uncapacitated, Fixed-Charge Network Flow Problem

Networks

Volumn 41, Issue 3, 2003, Pages 143-158

  Ortega, Francisco ^a   Wolsey, Laurence A ^b  

^a N SIDE SA   (Belgium)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Branch and cut; Branching; Dicut inequalities; Fixed charge; Heuristics; Minimum cost flow; Network design

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; HEURISTIC METHODS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBLEM SOLVING; SOFTWARE PROTOTYPING; TREES (MATHEMATICS);

BRANCH AND CUT; BRANCHING; DICUT INEQUALITIES; FIXED CHARGE; HEURISTICS; MINIMUM-COST FLOW; NETWORK DESIGN;

PROBLEM SOLVING;

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

References (43)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. A. Atamtürk, On the network design cut set polyhedra, Draft, Department of Industrial Ingineering and Operations Research, University of California at Berkley, 1999.
3. M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser, "Network models," Handbooks in OR, Elsevier, Amsterdam, 1995, Vol. 7.
4. I. Barany, T.J. van Roy, and L.A. Wolsey, Uncapacitated lot-sizing: The convex hull of solutions, Math Program Stud 22 (1984), 32-43.
5. R.S. Barr, F. Glover, and D. Klingman, A new optimization method for large scale fixed charge transportation problems, Oper Res 29 (1981), 448-463.
6. J.E. Beasley, An sst-based algorithm for the steiner problem in graphs, Networks 19 (1989), 1-16.
7. G. Belvaux, Modelling and solving lot-sizing problems by mixed integer programming, Ph.D. thesis, F.S.A. - Université catholique de Louvain, 1998.
8. D. Bienstock, Experiments with a network design algorithm using epsilon-approximate linear programs, Technical report TR-1999-4, Computational Optimization Research Center, Columbia University, New York, 1996.
9. R.E. Bixby, S. Ceria, C.M. McZeal, and M.W.P. Savelsbergh, An updated mixed integer programming library: MIPLIB 3.0, Optima 58 (1998), 12-15. Problems available at http://www.caam.rice.edu/bixby/miplib/miplib.html.
10. A.V. Cabot and S.S. Erenguc, Some branch and bound procedures for fixed-cost transportation problems, Nav Res Log Q 31 (1984), 145-154.
11. S. Chopra, E. Gorres, and M.R. Rao, Solving a Steiner tree problem on a graph using branch and cut, ORSA J Comput 4 (1992), 320-335.
12. T. Christof and A. Löbel, PORTA - A polyhedron representation and transformation algorithm, ZIB, Konrad-Zuse-Zentrum für Informationstechnik Berlin.
13. C. Cordier, H. Marchand, R. Laundy, and L.A. Wolsey. bc-opt: A branch and cut code for mixed integer programs, Math Program 86 (1999), 335-353.
14. F.R.B. Cruz, J. MacGregor Smith, and G.R. Mateus, Solving to optimality the uncapacitated fixed-charge network flow problem, Comput Oper Res 25 (1998), 67-81.
15. Dash Associates, XPRESS-MP extended modelling and optimisation subroutine library, Reference manual, Release 11, Blisworth House, Blisworth, Northants NN73BX, U.K., 1999.
16. Dash Associates, XPRESS-MP, Reference manual, Release 11, Blisworth House, Blisworth, Northants NN73BX, U.K., 1999.
17. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, 1979.
18. M.X. Goemans, personal communication, Dec. 1998.
19. G.M. Guisewite and P.M. Pardalos, Minimum concave-cost network flow problems, Ann Oper Res 25 (1990), 75-100.
20. O. Günlük, A branch-and-cut algorithm for capacitated network design problems, Math Program 86 (1999), 17-39.
21. O. Günlük and Y. Pochet, Mixing mixed-integer inequalities, Math Program 90 (1998), 429-457.
22. J.W. Herrrnan, G. Ioannou, I. Minis, R. Nagi, and J.M. Proth, Design of material flow networks in manufacturing facilities, Technical research report T.R.94-50, ISRI, University of Maryland, 1994.
23. D. Hochbaum and A. Segev, Analysis of a flow problem with fixed charges, Networks 19 (1989), 291-312.
24. ILOG, Cplex 6.5, User's manual, 2000.
25. D. Kim and P. Pardalos, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, Oper Res Lett 24 (1998), 195-203.
26. D. Klingman, A. Napier, and J. Stutz, Netgen: A program for generating large scale capacitated assignment, transportation, and minimum-cost flow network problems, Mgmt Sci 20 (1974), 814-820.
27. T. Koch and A. Martin, Solving Steiner tree problems in graphs to optimality, Networks 32 (1998), 207-232.
28. A. Löbel, MCF: A network simplex implementation, Konrad-Zuse-Zentrum für Informationstechnik Berlin, http://www.zib.de/Optimization/Software/ Mcf/, 2000.
29. T.L. Magnanti and L.A. Wolsey, "Optimal trees," Handbooks in OR, Elsevier, Amsterdam, 1995, Vol. 7, Chapter 9.
30. H. Marchand, A. Martin, R. Weismantel, and L.A. Wolsey, Cutting planes in integer and mixed integer programming, DP 9953, CORE, Université catholique de Louvain-la-Neuve, 1999.
31. R.K. Martin and L. Schrage, Subset coefficient reduction cuts for 0/1 mixed integer programing, Oper Res 33 (1985), 505-526.
32. K. Mehlhorn, S. Näher, M. Seel, and C. Uhrig, The LEDA user manual, Version 4.1. http://www.mpi-sb.mpg.de/LEDA/MANUAL/MANUAL.html, 2000.
33. G.L. Nemhauser and L.A. Wolsey, Integer and combinatorial optimization, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley, New York, 1988.
34. U.S. Palekar, M.K. Karwan, and S. Zionts, A branch and bound method for the fixed charge transportation problem, Mgmt Sci 36 (1990), 1092-1105.
35. Y. Pochet and L.A. Wolsey, Algorithms and reformulations for lot sizing problems, DIMACS Ser DM TCS 20 (1995), 245-293.
36. R.L. Rardin and U. Choe, Tighter relaxations of fixed charge network flow problems, Technical report J-79-18, Industrial and System Engineering, Georgia Institute of Technology, Atlanta, GA, 1979.
37. R.L. Rardin and L.A. Wolsey, Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems, Eur J Oper Res 71 (1993), 95-109.
38. J.E. Schaffer, Use of penalties in the branch and bound procedure for the fixed charge transportation problem, Eur J Oper Res 43 (1989), 305-312.
39. M. Sun, J.E. Aronson, P.G. McKeown, and D. Drinka, A tabu search heuristic procedure for the fixed charge transportation problem, Eur J Oper Res 106 (1998), 441-456.
40. S. van Hoesel, Models and algorithms fot the single item lot-sizing problem, Ph.D. thesis, Erasmus University, Rotterdam, 1991.
41. T.J. van Roy and L.A. Wolsey, Valid inequalities and separation for uncapacitated fixed charge networks, Oper Res Lett 4 (1985), 105-112.
42. T.J. van Roy and L.A. Wolsey, Solving mixed integer programming problems using automatic reformulation, Oper Res 33 (1987), 45-57.
43. L.A. Wolsey, Personal webpage, http://www.core.ucl.ac.be/wolsey/default. htm.