Integer and Combinatorial Optimization

[1]  Manuel Laguna,et al.  Tabu Search , 1997 .

[2]  Gérard Cornuéjols,et al.  Branching on general disjunctions , 2011, Math. Program..

[3]  Laurence A. Wolsey,et al.  Reformulation and Decomposition of Integer Programs , 2009, 50 Years of Integer Programming.

[4]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[5]  M. Jünger,et al.  50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art , 2010 .

[6]  Ralph E. Gomory,et al.  Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem , 2010, 50 Years of Integer Programming.

[7]  Matteo Fischetti,et al.  Just MIP it! , 2010, Matheuristics.

[8]  Franz Rendl,et al.  Semidefinite Relaxations for Integer Programming , 2010, 50 Years of Integer Programming.

[9]  Arthur M. Geoffrion,et al.  Lagrangian Relaxation for Integer Programming , 2010, 50 Years of Integer Programming.

[10]  Gérard Cornuéjols,et al.  Valid inequalities for mixed integer linear programs , 2007, Math. Program..

[11]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

[12]  Edward Rothberg,et al.  An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions , 2007, INFORMS J. Comput..

[13]  John N. Hooker,et al.  Planning and Scheduling by Logic-Based Benders Decomposition , 2007, Oper. Res..

[14]  Timo Berthold,et al.  Improving the feasibility pump , 2007, Discret. Optim..

[15]  Michael A. Trick,et al.  A Benders approach for the constrained minimum break problem , 2007, Eur. J. Oper. Res..

[16]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[17]  Nicolas Jozefowiez,et al.  The vehicle routing problem: Latest advances and new challenges , 2007 .

[18]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[19]  Alain Chabrier,et al.  Vehicle Routing Problem with elementary shortest path based column generation , 2006, Comput. Oper. Res..

[20]  Karla Hoffman,et al.  A Column-Generation and Branch-and-Cut Approach to the Bandwidth-Packing Problem , 2006, Journal of research of the National Institute of Standards and Technology.

[21]  Martin W. P. Savelsbergh,et al.  Integer-Programming Software Systems , 2005, Ann. Oper. Res..

[22]  Jeff Linderoth,et al.  Noncommercial Software for Mixed-Integer Linear Programming , 2005 .

[23]  Dimitris Bertsimas,et al.  Optimization over integers , 2005 .

[24]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[25]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[26]  Thorsten Koch,et al.  Branching rules revisited , 2005, Oper. Res. Lett..

[27]  E. Balas,et al.  Pivot and shift - a mixed integer programming heuristic , 2004, Discret. Optim..

[28]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[29]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[30]  John N. Hooker,et al.  Logic, Optimization, and Constraint Programming , 2002, INFORMS J. Comput..

[31]  Martin W. P. Savelsbergh,et al.  A branch and cut approach to the cardinality constrained circuit problem , 2002, Math. Program..

[32]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[33]  Sanjay Mehrotra,et al.  Experimental Results on Using General Disjunctions in Branch-and-Bound for General-Integer Linear Programs , 2001, Comput. Optim. Appl..

[34]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

[35]  Alexander Martin,et al.  General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms , 2000, Computational Combinatorial Optimization.

[36]  S. Hadano.  A radiation hybrid transcript map of the mouse genome , 2001, Nature Genetics.

[37]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[38]  Ralf Borndörfer,et al.  Set packing relaxations of some integer programs , 2000, Math. Program..

[39]  Martin W. P. Savelsbergh,et al.  Conflict graphs in solving integer programming problems , 2000, Eur. J. Oper. Res..

[40]  François Vanderbeck,et al.  On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm , 2000, Oper. Res..

[41]  Xiang-Sun Zhang,et al.  Neural networks in optimization , 2000 .

[42]  K. Aardal,et al.  Polyhedral techniques in combinatorial optimization II: applications and computations , 1999 .

[43]  Martin W. P. Savelsbergh,et al.  A Computational Study of Search Strategies for Mixed Integer Programming , 1999, INFORMS J. Comput..

[44]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[45]  Egon Balas,et al.  Disjunctive Programming: Properties of the Convex Hull of Feasible Points , 1998, Discret. Appl. Math..

[46]  Lap Mui Ann Chan,et al.  Worst-case analyses, linear programming and the bin-packing problem , 1998, Math. Program..

[47]  Lap Mui Ann Chan,et al.  Parallel Machine Scheduling, Linear Programming, and Parameter List Scheduling Heuristics , 1998, Oper. Res..

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

[49]  C. P. Ravikumar,et al.  Parallel Methods for Vlsi Layout Design , 1998, IEEE Concurrency.

[50]  Andrew Odlyzko,et al.  The Rise and Fall of Knapsack Cryptosystems , 1998 .

[51]  R. Shah.  Optimization Problems in SONET WDM Ring Architecture , 1998 .

[52]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..

[53]  David Simchi-Levi,et al.  On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows , 1997, Oper. Res..

[54]  George L. Nemhauser,et al.  Airline Crew Scheduling: A New Formulation and Decomposition Algorithm , 1997, Oper. Res..

[55]  E. Balas,et al.  Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

[56]  Egon Balas,et al.  Gomory cuts revisited , 1996, Oper. Res. Lett..

[57]  Kenneth McAloon,et al.  Optimization and computational logic , 1996, Wiley-Interscience series in discrete mathematics and optimization.

[58]  George L. Nemhauser,et al.  The fleet assignment problem: Solving a large-scale integer program , 1995, Math. Program..

[59]  George L. Nemhauser,et al.  Lifted cover facets of the 0-1 knapsack polytope with GUB constraints , 1994, Oper. Res. Lett..

[60]  Martin W. P. Savelsbergh,et al.  Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..

[61]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[62]  George L. Nemhauser,et al.  Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..

[63]  Jennifer Ryan,et al.  A column generation algorithm for bandwidth packing , 1993, Telecommun. Syst..

[64]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

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

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

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

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

[69]  G. Nemhauser,et al.  A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing , 1992 .

[70]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[71]  Manfred W. Padberg,et al.  Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut , 1991, INFORMS J. Comput..

[72]  Laurence A. Wolsey,et al.  Multi-item lot-sizing problems using strong cutting planes , 1991 .

[73]  Jephthah A. Abara,et al.  Applying Integer Linear Programming to the Fleet Assignment Problem , 1989 .

[74]  J. Tind.  Decomposition in integer programming , 1989 .

[75]  David Kendrick,et al.  GAMS, a user's guide , 1988, SGNM.

[76]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[77]  Martin Grötschel,et al.  An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..

[78]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[79]  Alexander H. G. Rinnooy Kan,et al.  An introduction to the analysis of approximation algorithms , 1986, Discret. Appl. Math..

[80]  L. C. Thomas,et al.  Model Building in Mathematical Programming (2nd Edition) , 1986 .

[81]  M. Padberg,et al.  Lp-based combinatorial problem solving , 1985 .

[82]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[83]  Laurence A. Wolsey,et al.  Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem , 1980, Oper. Res..

[84]  E. Balas,et al.  Pivot and Complement–A Heuristic for 0-1 Programming , 1980 .

[85]  M. Padberg.  Covering, Packing and Knapsack Problems , 1979 .

[86]  Richard C. Larson,et al.  Model Building in Mathematical Programming , 1979 .

[87]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[88]  Richard M. Karp,et al.  Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[89]  G. Ding.  Discrete optimization , 1977 .

[90]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[91]  Laurence A. Wolsey,et al.  Technical Note - Facets and Strong Valid Inequalities for Integer Programs , 1976, Oper. Res..

[92]  Peter L. Hammer,et al.  Facet of regular 0–1 polytopes , 1975, Math. Program..

[93]  Egon Balas,et al.  Facets of the knapsack polytope , 1975, Math. Program..

[94]  Laurence A. Wolsey,et al.  Faces for a linear inequality in 0–1 variables , 1975, Math. Program..

[95]  Leslie E. Trotter,et al.  Properties of vertex packing and independence system polyhedra , 1974, Math. Program..

[96]  Manfred W. Padberg,et al.  Perfect zero–one matrices , 1974, Math. Program..

[97]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[98]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[99]  G. Nemhauser,et al.  Integer Programming , 2020 .

[100]  Egon Balas,et al.  On the Set-Covering Problem , 1972, Oper. Res..

[101]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[102]  L. G. Mitten.  Branch-and-Bound Methods: General Formulation and Properties , 1970, Oper. Res..

[103]  A. A. Robichek,et al.  Mathematical Programming and the Analysis of Capital Budgeting Problems. , 1964 .

[104]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[105]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[106]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[107]  A. S. Manne,et al.  On the Solution of Discrete Programming Problems , 1956 .

[108]  H. Weyl.  Elementare Theorie der konvexen Polyeder , 1934 .