Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem

References

• Archetti C, Speranza MG, Savelsbergh MWP. An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Sci. (2008) 42(1):22–31Link, Google Scholar
• Crainic T, Gendreau M. Cooperative parallel tabu search for capacitated network design. J. Heuristics (2002) 8(6):601–627Crossref, Google Scholar
• Crainic TG, Gendreau M, Farvolden JM. A simplex-based tabu search method for capacitated network design. INFORMS J. Comput. (2000) 12(3):223–236Link, Google Scholar
• Danna E, Rothberg E, Le Pape C. Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Programming (2005) 102(1):71–90Crossref, Google Scholar
• De Franceschi R, Fischetti M, Toth P. A new ILP-based refinement heuristic for vehicle routing problems. Math. Programming B (2006) 105(2):471–499Crossref, Google Scholar
• Fischetti M, Lodi A. Local branching. Math. Programming (2003) 98(1):23–47Crossref, Google Scholar
• Fukasawa R, Longo H, Lysgaard J, Aragão MP, Reis M, Uchoa E, Werneck RF. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. programming (2006) 106(3):491–511Crossref, Google Scholar
• Ghamlouch I, Crainic T, Gendreau M. Cycle-based neighborhoods for fixed charge capacitated multicommodity network design. Oper. Res. (2003) 51(4):655–667Link, Google Scholar
• Ghamlouch I, Crainic T, Gendreau M. Path relinking, cycle-based neighborhoods, and capacitated multicommodity network design. Ann. Oper. Res. (2004) 131(1):109–133Crossref, Google Scholar
• Glover F. A template for scatter search and path relinking. Lecture Notes Comput. Sci. (1998) 1363:13–54Google Scholar
• Gropp W. Using MPI: Portable Parallel Programming with the Message Passing Interface (1999) (The MIT Press, Cambridge, MA) Google Scholar
• Hewitt M, Nemhauser GL, Savelsbergh MWP. Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS J. Comput. (2010) 22(2):314–325Link, Google Scholar
• Hooker JN, Ottosson G. Logic-based Benders decomposition. Math. Programming (2003) 96(1):33–60Crossref, Google Scholar
• ILOGILOG CPLEX User's Manual (2008) . ILOGGoogle Scholar
• Nemhauser GL, Wolsey LA. Integer and Combinatorial Optimization (1988) (Wiley, New York) Crossref, Google Scholar
• Savelsbergh MWP, Song J-H. An optimization algorithm for inventory routing with continuous moves. Comput. Oper. Res. (2008) 35(7):2266–2282Crossref, Google Scholar
• Schmid V, Doerner KF, Hartl RF, Savelsbergh MWP, Stoecher W. A hybrid solution approach for ready-mixed concrete delivery. Transportation Sci. (2008) 43(1):70–85Link, Google Scholar
• Song J-H, Furman K. A maritime inventory routing problem: Practical approach. Comput. Oper. Res. (2010) . Published online before print, November 12, http://dx.doi.org/10.1016/j.cor.2010.10.031Google Scholar