[ASC95]    INFORMATION PROCESSING SYSTEM Accredited Standards Committee, X3. The ISO/ANSI C++ Draft, 1995. http://www.cygnus.com/misc/wp/.

[Bay72]    R. Bayer. Symmetric binary b-trees: Data structure and maintenance algorithms. Acta Informatica, 1:290–306, 1972.

[BCC93a]   Egon Balas, Sebastian Ceria, and Gerard Cornuéjols. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming, 58:295–324, 1993.

[BCC93b]   Egon Balas, Sebastian Ceria, and Gerard Cornuéjols. Solving mixed 0-1 programs by a lift-and-project method. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 232–242, 1993.

[BJN⁺97]   Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh, and Pamela H. Vance. Branch-and-price: Column generation for huge integer programs. Operations Research, 1997. to appear.

[Boo94]    G. Booch. Object-oriented analysis and design with applications. The Benjamin Cummings Publishing Company, Redwood City, California, 1994.

[CLR90]    T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to algorithms. MIT Press, Cambridge, 1990.

[ES92]    M.A. Ellis and B. Stroustrup. The annotated C++ reference manual. Addison Wesley, Reading, Massachusetts, 1992.

[GS78]    L.J. Guibas and R. Sedgewick. A diochromatic framework for balanced trees. In Proceedings of the 19th annual symposium on foundations of computer science, pages 8–21. IEEE Computer Society, 1978.

[HP93]    Karla Hoffman and Manfred W. Padberg. Solving airline crew scheduling problems by branch-and-cut. Management Science, 39:657–682, 1993.

[JRT94]    Michael Jünger, Gerhard Reinelt, and Stefan Thienel. Provably good solutions for the traveling salesman problem. Zeitschrift für Operations Research, 40:183–217, 1994.

[JRT95]    Michael Jünger, Gerhard Reinelt, and Stefan Thienel. Practical problem solving with cutting plane algorithms in combinatorial optimization. In Willian Cook, Lázló Lovász, and Paul Seymour, editors, Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 111–152. American Mathematical Society, 1995.

[KM90]    T. Korson and J.D. McGregor. Understanding object-oriented: A unifying paradigm. Communications of the ACM, 33(9):40–60, 1990.

[Knu93]    Donald E. Knuth. The Stanford GraphBase: a platform for combinatorial computing. Addison-Wesley, Reading, Massachusetts, 1993.

[Lei95]    Sebastian Leipert. Vbctool—a graphical interface for visualization of branch-and-cut algorithms. Technical report, Institut für Informatik, Universität zu Köln, 1995. http://www.informatik.uni-koeln.de/ls_juenger/projects/vbctool.html.

[PR91]    Manfred W. Padberg and Giovanni Rinaldi. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review, 33:60–100, 1991.

[RF81]    David M. Ryan and B.A. Foster. An integer programming approach to scheduling. In A. Wren, editor, Computer scheduling of public transport urban passenger vehicle and crew scheduling, pages 269–280. North Holland, Amsterdam, 1981.

[Sav94]    Martin W.P. Savelsbergh. Preprocessing and probing for mixed integer programming problems. ORSA Journal on Computing, 6:445–454, 1994.

[Str93]    B. Stroustrup. The C++ programming language—2nd edition. Addison-Wesley, Reading, Massachusetts, 1993.

[Thi95]    Stefan Thienel. ABACUS—A Branch-And-CUt System. PhD thesis, Universität zu Köln, 1995.

[VBJN94]   Pamela H. Vance, Cynthia Barnhart, Ellis J. Johnson, and George L. Nemhauser. Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications, 3:111–130, 1994.

[Wun97]    Roland Wunderling. SoPlex, The Sequential object-oriented simplex class library, 1997. http://www.zib.de/Optimization/Software/Soplex/.