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

\bibitem[AD92]{AD:lessons}
R.~W. Ashford and R.~C. Daniel.
\newblock Some lessons in solving practical integer programs.
\newblock {\em Journal of the Operational Research Society}, 43(5):425--433,
  1992.

\bibitem[AK89]{AK:anneal}
Emile~H.L. Aarts and Jan Korst.
\newblock {\em Simulated Annealing and Boltzmann Machines: A Stochastic
  Approach to Combinatorial Optimization and Neural Computing}.
\newblock Wiley, Chichester, 1989.

\bibitem[AL87]{AVL:simulated}
Emile H.~L. Aarts and Peter J. M.~Van Laarhoven.
\newblock {\em Simulated Annealing: Theory and Applications}.
\newblock Kluwer Academic Publishers, 1987.

\bibitem[AMO93]{AMO:flows}
Ravindra~K. Ahuja, Thomas~L. Magnanti, and James~B. Orlin.
\newblock {\em Network Flows : Theory, Algorithms, and Applications}.
\newblock Prentice Hall, Englewood Cliffs, NJ, 1993.

\bibitem[Bab92]{babai:hard}
L{\'{a}}szl{\'{o}} Babai.
\newblock Combinatorial optimization is hard.
\newblock {\em Focus}, 12(5):3--18, September 1992.

\bibitem[BBI92]{BBI:miplib}
Robert~E. Bixby, E.~Andrew Boyd, and Ronni~R. Indovina.
\newblock {MIPLIB}: A test set of mixed integer programming problems.
\newblock {\em SIAM News}, 25(20):16, March 1992.

\bibitem[Bea90]{beasley:orlib}
J.~E. Beasley.
\newblock {OR}-library: Distributing test problems by electronic mail.
\newblock {\em Journal of the Operational Research Society}, 41(11):1069--1072,
  1990.

\bibitem[Ber91]{Bertsekas:flows}
Dimitri~P. Bertsekas.
\newblock {\em Linear Network Optimization: Algorithms and Codes}.
\newblock {MIT} Press, Cambridge, MA, 1991.

\bibitem[BJN{\etalchar{+}}93]{BJNSV:formulate}
Cynthia Barnhart, Ellis~L. Johnson, George~L. Nemhauser, Gabriele Sigismondi,
  and Pamela Vance.
\newblock Formulating a mixed integer programming problem to improve
  solvability.
\newblock {\em Operations Research}, 41(6):1013--1019, 1993.

\bibitem[Bla93]{Blaz:scheduling}
Jacek Blazewicz.
\newblock {\em Scheduling in computer and manufacturing systems}.
\newblock Springer-Verlag, New York, 1993.

\bibitem[CLR90]{CLR:algorithms}
Thomas~H. Cormen, Charles~E. Leiserson, and Ronald~L. Rivest.
\newblock {\em Introduction to Algorithms}.
\newblock MIT Press, Cambridge, MA, 1990.

\bibitem[Cof76]{Coffman:scheduling}
E.~G. Coffman.
\newblock {\em Computer and Job Shop Scheduling Theory}.
\newblock Wiley, New York, 1976.

\bibitem[Dav87]{Davis:genandsim}
Lawrence Davis.
\newblock {\em Genetic Algorithms and Simulated Annealing}.
\newblock Morgan Kaufmann, Los Altos, CA, 1987.

\bibitem[Dav91]{Davis:handbook}
Lawrence Davis.
\newblock {\em Handbook of Genetic Algorithms}.
\newblock Van Nostrand Reinhold, New York, 1991.

\bibitem[Fis81]{Fisher:lagrange}
Marshall~L. Fisher.
\newblock The lagrangian relaxation method for solving integer programming
  problems.
\newblock {\em Management Science}, 27(1):1--18, January 1981.

\bibitem[Fou84]{Foulds:combopt}
L.~R. Foulds.
\newblock {\em Combinatorial Optimization for Undergraduates}.
\newblock Springer Verlag, New York, 1984.

\bibitem[GJ79]{GJ:candi}
Michael~R. Garey and David~S. Johnson.
\newblock {\em Computers and Intractibility: A Guide to the Theory of
  {NP}-Completeness}.
\newblock W. H. Freeman and Company, New York, 1979.

\bibitem[GKP92]{GKP:flows}
Fred Glover, Darwin Klingman, and Nancy Phillips.
\newblock {\em Network Models in Optimization and Their Applications in
  Practice}.
\newblock Wiley, New York, 1992.

\bibitem[Glo89]{Glover:tabuI}
Fred Glover.
\newblock Tabu search-- part {I}.
\newblock {\em ORSA Journal on Computing}, 1(3):190--206, 1989.

\bibitem[Glo90a]{Glover:tabuII}
Fred Glover.
\newblock Tabu search-- part {II}.
\newblock {\em ORSA Journal on Computing}, 2(1):4--32, 1990.

\bibitem[Glo90b]{Glover:tutorial}
Fred Glover.
\newblock Tabu search: A tutorial.
\newblock {\em Interfaces}, 20(4):74--94, 1990.

\bibitem[GLS88]{GLS:geometric}
Martin Gr{\"{o}}tschel, L{\'{a}}szl{\'{o}} Lov{\'{a}}sz, and Alexander
  Schrijver.
\newblock {\em Geometric Algorithms and Combinatorial Optimization}.
\newblock Springer-Verlag, New York, 1988.

\bibitem[Gol89]{Goldberg:genetic}
David~E. Goldberg.
\newblock {\em Genetic Algorithms in Search, Optimization, and Machine
  Learning}.
\newblock Addison--Wesley, Reading, MA, 1989.

\bibitem[HS84]{HS:algorithms}
Ellis Horowitz and Sartaj Sahni.
\newblock {\em Fundamentals of Computer Algorithms}.
\newblock Computer Science Press, Rockville, MD, 1984.

\bibitem[Hu82]{Hu:algorithms}
T.~C. Hu.
\newblock {\em Combinatorial Algorithms}.
\newblock Addison-Wesley, Reading, MA, 1982.

\bibitem[Joh92]{Johnson:tale}
David~S. Johnson.
\newblock The {NP}-completeness column: An ongoing guide.
\newblock {\em Journal of Algorithms}, 13(3):502--524, September 1992.

\bibitem[Jun85]{Junger:asp}
Michael Junger.
\newblock {\em Polyhedral Combinatorics and the Acyclic Subdigraph Problem}.
\newblock Helderman Verlag, Berlin, 1985.

\bibitem[KLS91]{KLS:greedoids}
Bernhard Korte, L{\'{a}}szl{\'{o}} Lov{\'{a}}sz, and Rainer Schrader.
\newblock {\em Greedoids}.
\newblock Springer-Verlag, New York, 1991.

\bibitem[Law76]{Lawler:combopt}
Eugene Lawler.
\newblock {\em Combinatorial Optimization: Networks and Matroids}.
\newblock Saunders College Publishing, Fort Worth, 1976.

\bibitem[Law85]{Lawler:tour}
Eugene Lawler.
\newblock {\em The Traveling Salesman Problem: A Guided Tour of Combinatorial
  Optimization}.
\newblock Wiley, New York, 1985.

\bibitem[MF00]{MF:heuristics}
Z.~Michalewicz and D.~B. Fogel.
\newblock {\em How to Solve It: Modern Heuristics}.
\newblock Springer, Heidelberg, Germany, 2000.

\bibitem[MT90]{MT:knapsack}
Silvano Martello and Paolo Toth.
\newblock {\em Knapsack Problems: Algorithms and Computer Implementations}.
\newblock Wiley, New York, 1990.

\bibitem[NW88]{NW:icopt}
George~L. Nemhauser and Laurence~A. Wolsey.
\newblock {\em Integer and Combinatorial Optimization}.
\newblock John Wiley and Sons, New York, 1988.

\bibitem[OLK85]{OLR:biblio}
M.~O'hEigeartaigh, J.~K. Lenstra, and A.~H. G.~Rinnooy Kan.
\newblock {\em Combinatorial Optimization: Annotated Bibliographies}.
\newblock Wiley, New York, 1985.

\bibitem[Oxl92]{Oxley:matroids}
J.~G. Oxley.
\newblock {\em Matroid Theory}.
\newblock Oxford University Press, New York, 1992.

\bibitem[Pap94]{Papa:complexity}
Christos~H. Papadimtriou.
\newblock {\em Computational Complexity}.
\newblock Addison-Wesley, Reading, MA, 1994.

\bibitem[PR88]{PR:discopt}
R.~Gary Parker and Ronald~L. Rardin.
\newblock {\em Discrete Optimization}.
\newblock Academic Press, Boston, 1988.

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

\bibitem[PS82]{PS:combopt}
Christos~H. Papadimtriou and Kenneth Steiglitz.
\newblock {\em Combinatorial Optimization: Algorithms and Complexity}.
\newblock Prentice-Hall, Englewood Cliffs, NJ, 1982.

\bibitem[Ree93]{Reeves:modern}
Colin~R. Reeves.
\newblock {\em Modern Heuristic Techniques for Combinatorial Problems}.
\newblock Halsted Press, New York, 1993.

\bibitem[Rei91]{Reinelt:tsplib}
Gerhard Reinelt.
\newblock {TSPLIB}--- a traveling salesman problem library.
\newblock {\em ORSA Journal on Computing}, 3(4):376--384, 1991.

\bibitem[Sch87]{Sch:theory}
Alexander Schrijver.
\newblock {\em Theory of Linear and Integer Programming}.
\newblock John Wiley and Sons, New York, 1987.

\bibitem[Sha79]{Shapiro:lagrange}
Jeremy~F. Shapiro.
\newblock A survey of lagrangian techniques for discrete optimization.
\newblock {\em Annals of Discrete Mathematics}, 5:113--138, 1979.

\bibitem[SM89]{SM:foundations}
Harvey~M. Salkin and Kamlesh Mathur.
\newblock {\em Foundations of Integer Programming}.
\newblock North-Holland, New York, 1989.

\bibitem[Sto92]{Stoer:design}
Mechthild Stoer.
\newblock {\em Design of Survivable Networks}, volume 1531 of {\em Lecture
  Notes in Mathematics}.
\newblock Springer Verlag, Heidelberg, 1992.

\bibitem[Tar83]{Tarjan:algorithms}
Robert~Endre Tarjan.
\newblock {\em Data Structures and Network Algorithms}.
\newblock SIAM, Philadelphia, PA, 1983.

\bibitem[Wil85]{Williams:models}
H.~P. Williams.
\newblock {\em Model Building in Mathematical Programming}.
\newblock Wiley, New York, second edition, 1985.

\end{thebibliography}
