论文信息 - BAC : A BCP based Branch-and-Cut Example

BAC : A BCP based Branch-and-Cut Example

This paper is an introduction to the Branch-and-Cut-and-Price (BCP) software from the user perspective. It focuses on a simple example illustrating the basic operations used in a Branch-and-Cut: cuts and heuristic solutions generation, and customized branching. Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA 15213-3890, U.S.A. Email: fmargot@andrew.cmu.edu . Work initiated in 2003 while visiting the Department of Mathematical Sciences, IBM T.J. Watson Research Center, Yorktown Heights, NY 10598.

François Margot

[1] Martin Grötschel,et al. Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

[2] Michael Jünger,et al. Computational Combinatorial Optimization , 2001, Lecture Notes in Computer Science.

[3] Francisco Barahona,et al. Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut , 2006, RAIRO Oper. Res..

[4] Giovanni Rinaldi,et al. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[5] Jon Lee,et al. Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem , 2005, Ann. Oper. Res..

[6] G. Nemhauser,et al. Integer Programming , 2020 .

[7] Leslie E. Trotter,et al. Branch, Cut, and Price: Sequential and Parallel , 2000, Computational Combinatorial Optimization.