Bibliography

1

http://www-124.ibm.com/developerworks/opensource/coin .

2

http://www-124.ibm.com/developerworks/opensource/coin/Doxygen/ Bcp/index.html (single line address).

3

Barahona F., Ladányi L., ``Branch-and-Cut Based on the Volume Algorithm: Steiner Trees in Graphs and Max Cut'', IBM Research report RC22221 (2001).

4

Jünger M., Naddef D., eds., Computational Combinatorial Optimization, Lecture Notes in Computer Science 2241, Springer (2001).

5

Ladányi L., Forrest J.J., Kalagnanam J.R., ``Column Generation Approach to the Multiple Problem with Color Contraints'', IBM Research report RC22013 (2001).

6

Ladányi L., Ralphs T.K., Trotter L.E., ``Branch, Cut, and Price: Sequential and Parallel'', in [4], 223-260.

7

Padberg M.W., Rinaldi G., ``A Branch-and-Cut Algorithm for the Resolution of Large Scale Symmetric Travelling Salesman Problems'', SIAM Review 33 (1991), 60-100.

8

Wolsey L.A., Integer Programming, Wiley (1998).