Enumerative Methods in Integer Programming

[1]  E. M. L. Beale,et al.  Global optimization using special ordered sets , 1976, Math. Program..

[2]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[3]  H. Greenberg,et al.  A Branch Search Algorithm for the Knapsack Problem , 1970 .

[4]  F. Glover.  A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[5]  Peter L. Hammer,et al.  Constraint Pairing In Integer Programming , 1975 .

[6]  E. Balas.  An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[7]  A. M. Geoffrion.  Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .

[8]  R. Gomory.  Some polyhedra related to combinatorial problems , 1969 .

[9]  S. Zionts.  Generalized implicit enumeration using bounds on variables for solving linear programs with zero‐one variables , 1972 .

[10]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[11]  Abraham Charnes,et al.  An Algorithm for Solving Integer Interval Linear Programming Problems: A New Method for Mixed Integer Programming. , 1973 .

[12]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[13]  Frederick S. Hillier,et al.  The Accelerated Bound-and-Scan Algorithm for Integer Programming , 1975, Oper. Res..

[14]  P. Mevert,et al.  Implicit Enumeration with Generalized Upper Bounds , 1977 .

[15]  K. Spielberg.  Plant Location with Generalized Search Origin , 1969 .

[16]  Kurt Spielberg,et al.  Direct Search Algorithms for Zero-One and Mixed-Integer Programming , 1967, Oper. Res..

[17]  H. D. Ratliff,et al.  Set Covering and Involutory Bases , 1971 .

[18]  Michel Bénichou,et al.  The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results , 1977, Math. Program..

[19]  K. Spielberg,et al.  Mixed-integer algorithms for the (0,l) knapsack problem , 1972 .

[20]  J. F. Pierce.  Application of Combinatorial Programming to a Class of All-Zero-One Integer Programming Problems , 1968 .

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

[22]  Frederick S. Hillier,et al.  Efficient Heuristic Procedures for Integer Linear Programming with an Interior , 1969, Oper. Res..

[23]  J. Rubin.  A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew Scheduling , 1973 .

[24]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[25]  Frederick S. Hillier.  A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables , 1969, Oper. Res..

[26]  G. Ribiere,et al.  Experiments in mixed-integer linear programming , 1971, Math. Program..

[27]  Fred Glover,et al.  Dynamic strategies for branch and bound , 1976 .

[28]  Nicos Christofides,et al.  Zero-One Programming Using Non-Binary Tree-Search , 1971, Comput. J..

[29]  John A. Tomlin,et al.  An integer programming approach to a class of combinatorial problems , 1972, Math. Program..

[30]  P. Krolak,et al.  The bounded variable algorithm for solving integer linear programming problems , 1968 .

[31]  Marshall L. Fisher,et al.  Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I , 1973, Oper. Res..

[32]  V. Joseph Bowman,et al.  Partial Orderings in Implicit Enumeration , 1977 .

[33]  M. Guignard,et al.  Reduction Methods for State Enumeration Integer Programming , 1977 .

[34]  Jeremy F. Shapiro,et al.  Generalized Lagrange Multipliers in Integer Programming , 2011, Oper. Res..

[35]  M. Guignard,et al.  Algorithms for Exploiting the Structure of the Simple Plant Location Problem , 1977 .

[36]  Raymond Breu,et al.  Branch and bound experiments in zero-one programming , 1974 .

[37]  Monique Guignard-Spielberg,et al.  Search techniques with adaptive features for certain integer and mixed integer programming problems , 1968, IFIP Congress.

[38]  Robert G. Jeroslow,et al.  Experimental results on Hillier's linear search , 1975, Math. Program..

[39]  John J. H. Forrest,et al.  Practical Solution of Large Mixed Integer Programming Problems with Umpire , 1974 .

[40]  J. Krarup,et al.  Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .

[41]  E. M. L. Beale,et al.  Survey of Integer Programming , 1965 .

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

[43]  J. F. Pierce,et al.  Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems , 1973 .

[44]  Leslie E. Trotter,et al.  An Algorithm for the Bounded Variable Integer Programming Problem , 1974, JACM.

[45]  P. S. Davis,et al.  A branch‐bound algorithm for the capacitated facilities location problem , 1969 .

[46]  Arthur M. Geoffrion,et al.  An Improved Implicit Enumeration Approach for Integer Programming , 1969, Oper. Res..

[47]  Irinel Dragan.  Un algorithme lexicographique pour la résolution des programmes linéaires en variables binaires , 1969 .

[48]  George L. Nemhauser,et al.  The Set-Partitioning Problem: Set Covering with Equality Constraints , 1969, Oper. Res..

[49]  Egon Balas,et al.  Discrete Programming by the Filter Method , 1967, Oper. Res..

[50]  Djangir A. Babayev,et al.  Comments on the note of Frieze , 1974, Math. Program..

[51]  A. M. FRIEZE.  A cost function property for plant location problems , 1974, Math. Program..

[52]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[53]  A. M. Geoffrion,et al.  Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .

[54]  Norman J. Driebeek.  An Algorithm for the Solution of Mixed Integer Programming Problems , 1966 .

[55]  L. Schrage.  Implicit representation of variable upper bounds in linear programming , 1975 .

[56]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

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

[58]  Thomas L. Morin,et al.  A hybrid approach to discrete mathematical programming , 2015, Math. Program..

[59]  E. Balas,et al.  Canonical Cuts on the Unit Hypercube , 1972 .

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

[61]  Ellis L. Johnson,et al.  Some continuous functions related to corner polyhedra , 1972, Math. Program..

[62]  Kurt Spielberg,et al.  Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..

[63]  Clifford C. Petersen,et al.  Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects , 1967 .

[64]  Michael Florian,et al.  An Implicit Enumeration Algorithm for the Machine Sequencing Problem , 1971 .

[65]  D. FAYARD,et al.  Resolution of the 0–1 knapsack problem: Comparison of methods , 1975, Math. Program..

[66]  M. Florian,et al.  An implicit enumeration algorithm for complex scheduling problems , 1975 .