\newcommand{\etalchar}[1]{$^{#1}$}
\begin{thebibliography}{BJN{\etalchar{+}}97}

\bibitem[ASC95]{Iso95}
INFORMATION PROCESSING~SYSTEM Accredited Standards~Committee, X3.
\newblock {\em The ISO/ANSI {C$++$} Draft}, 1995.
\newblock \htmladdnormallink{http://www.cygnus.com/misc/wp/}
  {http://www.cygnus.com/misc/wp/}.

\bibitem[Bay72]{Bay72}
R.~Bayer.
\newblock Symmetric binary $b$-trees: Data structure and maintenance
  algorithms.
\newblock {\em Acta Informatica}, 1:290--306, 1972.

\bibitem[BCC93a]{BCC93a}
Egon Balas, Sebastian Ceria, and Gerard Cornuejols.
\newblock A lift-and-project cutting plane algorithm for mixed 0-1 programs.
\newblock {\em Mathematical Programming}, 58:295--324, 1993.

\bibitem[BCC93b]{BCC93b}
Egon Balas, Sebastian Ceria, and Gerard Cornuejols.
\newblock Solving mixed 0-1 programs by a lift-and-project method.
\newblock In {\em Proceedings of the Fourth Annual ACM-SIAM {S}ymposium on
  {D}iscrete {A}lgorithms}, pages 232--242, 1993.

\bibitem[BJN{\etalchar{+}}97]{BJN97}
Cynthia Barnhart, Ellis~L. Johnson, George~L. Nemhauser, Martin W.~P.
  Savelsbergh, and Pamela~H. Vance.
\newblock Branch-and-price: Column generation for huge integer programs.
\newblock {\em Operations Research}, 1997.
\newblock to appear.

\bibitem[Boo94]{Boo94}
G.~Booch.
\newblock {\em Object-oriented analysis and design with applications}.
\newblock The Benjamin Cummings Publishing Company, Redwood City, California,
  1994.

\bibitem[CLR90]{CLR90}
T.H. Cormen, C.E. Leiserson, and R.L. Rivest.
\newblock {\em Introduction to algorithms}.
\newblock MIT Press, Cambridge, 1990.

\bibitem[Cpl94]{Cpl94}
Cplex.
\newblock {\em Using the Cplex Callable Library and Cplex Mixed Integer
  Library}.
\newblock Cplex Optimization, Inc, 1994.

\bibitem[Cpl95]{Cpl95}
Cplex.
\newblock {\em Using the Cplex Callable Library}.
\newblock Cplex Optimization, Inc, 1995.

\bibitem[ES92]{ES92}
M.A. Ellis and B.~Stroustrup.
\newblock {\em The annotated {C$++$} reference manual}.
\newblock Addison Wesley, Reading, Massachusetts, 1992.

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

\bibitem[HP93]{HP93}
Karla Hoffman and Manfred~W. Padberg.
\newblock Solving airline crew scheduling problems by branch-and-cut.
\newblock {\em Management Science}, 39:657--682, 1993.

\bibitem[JRT94]{JRT94}
Michael J{\"{u}}nger, Gerhardt Reinelt, and Stefan Thienel.
\newblock Provably good solutions for the traveling salesman problem.
\newblock {\em Zeitschrift f\"ur Operations Research}, 40:183--217, 1994.

\bibitem[JRT95]{JRT95}
Michael J{\"u}nger, Gerhardt Reinelt, and Stefan Thienel.
\newblock Practical problem solving with cutting plane algorithms in
  combinatorial optimization.
\newblock In Willian Cook, L{\'a}zl{\'o} Lov{\'a}sz, and Paul Seymour, editors,
  {\em Combinatorial Optimization}, DIMACS Series in Discrete Mathematics and
  Theoretical Computer Science, pages 111--152. American Mathematical Society,
  1995.

\bibitem[KM90]{KM90}
T.~Korson and J.D. McGregor.
\newblock Understanding object-oriented: A unifying paradigm.
\newblock {\em Communications of the ACM}, 33(9):40--60, 1990.

\bibitem[Knu93]{Knu93a}
Donald~E. Knuth.
\newblock {\em The Stanford GraphBase: a platform for combinatorial computing}.
\newblock Addison-Wesley, Reading, Massachusetts, 1993.

\bibitem[Lei95]{Lei96}
Sebastian Leipert.
\newblock Vbctool---a graphical interface for visualization of branch-and-cut
  algorithms.
\newblock Technical report, Institut f\"ur Informatik, Universit\"at zu K\"oln,
  1995.
\newblock
  \htmladdnormallink{http://www.informatik.uni-koeln.de/ls\_juenger/projects/v%
bctool.html}{http://www.informatik.uni-koeln.de/ls\_juenger/projects/vbctool.h%
tml}.

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

\bibitem[RF81]{RF81}
D.M. Ryan and B.A. Foster.
\newblock An integer programming approach to scheduling.
\newblock In A.~Wren, editor, {\em Computer scheduling of public transport
  urban passenger vehicle and crew scheduling}, pages 269--280. North Holland,
  Amsterdam, 1981.

\bibitem[Sav94]{Sav94}
Martin~W.P. Savelsbergh.
\newblock Preprocessing and probing for mixed integer programming problems.
\newblock {\em ORSA Journal on Computing}, 6:445--454, 1994.

\bibitem[Str93]{Str93a}
B.~Stroustrup.
\newblock {\em The {C$++$} programming language---2nd edition}.
\newblock Addison-Wesley, Reading, Massachusetts, 1993.

\bibitem[Thi95]{Thi95}
Stefan Thienel.
\newblock {\em ABACUS---A Branch-And-CUt System}.
\newblock PhD thesis, Universit\"at zu K\"oln, 1995.

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

\bibitem[Wun97]{Wun97}
Roland Wunderling.
\newblock Soplex, the sequential object-oriented simplex class library.
\newblock Technical report, Konrad Zuse Zentrum f{\"u}r Informationstechnik,
  Berlin, 1997.
\newblock \htmladdnormallink{http://www.zib.de/Optimization/Software/Soplex/}
  {http://www.zib.de/Optimization/Software/Soplex/}.

\end{thebibliography}