A decade of combinatorial optimization

This paper offers a brief overview of the developments in combinatorial optimization during the past decade. We discuss improvements in polynomial- time algorithms for problems on graphs and networks, and review the methodological and computational progress in linear and integer optimization. Some of the more prominent software packages in these areas are mentioned. With respect to obtaining approximate solutions to NP-hard problems, we survey recent positive and negative results on polynomial-time approximability and summarize the advances in local search

[1]  Rekha R. Thomas.  A Geometric Buchberger Algorithm for Integer Programming , 1995, Math. Oper. Res..

[2]  Hoesel van Cpm,et al.  Polyhedral techniques in combinatorial optimization I: theory , 1996 .

[3]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[4]  David R. Karger,et al.  An Õ(n2) algorithm for minimum cuts , 1993, STOC.

[5]  László Lovász,et al.  The Generalized Basis Reduction Algorithm , 1990, Math. Oper. Res..

[6]  Stefan Thienel,et al.  ABACUS - a branch-and-CUt system , 1995 .

[7]  George L. Nemhauser,et al.  Functional description of MINTO : a mixed integer optimizer , 1991 .

[8]  Gil Kalai,et al.  A subexponential randomized simplex algorithm (extended abstract) , 1992, STOC '92.

[9]  Toshihide Ibaraki,et al.  Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[10]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[11]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

[12]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[13]  Kurt Mehlhorn,et al.  The LEDA Platform of Combinatorial and Geometric Computing , 1997, ICALP.

[14]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[15]  Carlo Traverso,et al.  Buchberger Algorithm and Integer Programming , 1991, AAECC.

[16]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

[17]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[18]  Jean-Philippe Vial,et al.  Theory and algorithms for linear optimization - an interior point approach , 1998, Wiley-Interscience series in discrete mathematics and optimization.

[19]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[20]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[21]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[22]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[23]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.

[24]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[25]  Karen Aardal,et al.  Polyhedral Techniques in Combinatorial Optimization , 1995 .

[26]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[27]  DyerMartin,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991 .

[28]  Michel X. Goemans,et al.  Worst-case comparison of valid inequalities for the TSP , 1995, Math. Program..

[29]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[30]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[31]  A. Federgruen,et al.  A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0n log n or 0n Time , 1991 .

[32]  Alok Aggarwal,et al.  Improved Algorithms for Economic Lot Size Problems , 1993, Oper. Res..

[33]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[34]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[35]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[36]  Wansoo T. Rhee,et al.  Martingale Inequalities, Interpolation and NP-Complete Problems , 1989, Math. Oper. Res..

[37]  J. J. Bisschop,et al.  AIMMS : The Modeling System , 1993 .

[38]  Albert P. M. Wagelmans,et al.  Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case , 1992, Oper. Res..

[39]  David Shallcross,et al.  An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming , 1993, INFORMS J. Comput..

[40]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[41]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[42]  Kenneth J. Giuliani.  Factoring Polynomials with Rational Coeecients , 1998 .

[43]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[44]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[45]  Andrew V. Goldberg,et al.  Experimental study of minimum cut algorithms , 1997, SODA '97.

[46]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[47]  R. Schultz,et al.  Solving stochastic programs with integer recourse by enumeration: a framework using Gro¨bner basis reductions , 1998 .

[48]  Hoesel van Cpm,et al.  Polyhedral techniques in combinatorial optimization II: computations , 1995 .

[49]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[50]  David P. Williamson,et al.  .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.

[51]  Alexander I. Barvinok,et al.  A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[52]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.