Computer Codes for Problems of Integer Programming

[1]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[2]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[3]  F. Glover.  AN ALL-INTEGER INTEGER PROGRAMMING ALGORITHM , 1963 .

[4]  Paula M. J. Harris.  An Algorithm for Solving Mixed Integer Linear Programmes , 1964 .

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

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

[7]  John Haldi,et al.  A Computer Code for Integer Solutions to Linear Programs , 1965 .

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

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

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

[11]  Robert B. Wilson.  Letter to the Editor - Stronger Cuts in Gomory's All-Integer Integer Programming Algorithm , 1967, Oper. Res..

[12]  C. A. Trauth,et al.  Integer Linear Programming: A Study in Computational Efficiency , 1969 .

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

[14]  Frantisek Fiala.  Computational experience with a modification of an algorithm by Hammer and Rudeanu for 0-1 linear programming , 1971, ACM '71.

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

[16]  L. Wolsey.  Extensions of the Group Theoretic Approach in Integer Programming , 1971 .

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

[18]  Jeremy F. Shapiro,et al.  Computational experience with a group theoretic integer programming algorithm , 1973, Math. Program..

[19]  Gautam Mitra.  Investigation of some branch and bound strategies for the solution of mixed integer linear programs , 1973, Math. Program..

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

[21]  Hisashi Mine,et al.  A heuristic algorithm for mixed-integer programming problems , 1974 .

[22]  R. E. Marsten.  An Algorithm for Large Set Partitioning Problems , 1974 .

[23]  Y. Toyoda.  A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems , 1975 .

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

[25]  A Sequential Approach to the $0 - 1$ Linear Programming Problem , 1976 .

[26]  P. Miliotis,et al.  Integer programming approaches to the travelling salesman problem , 1976, Math. Program..

[27]  Jean-Michel Gauthier,et al.  Experiments in mixed-integer linear programming using pseudo-costs , 1977, Math. Program..

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

[29]  Jeremy F. Shapiro,et al.  A Convergent Duality Theory for Integer Programming , 1977, Oper. Res..

[30]  Späth, H., Ausgewählte Operations Research‐Algorithmen in FORTRAN, München‐Wien. R. Oldenbourg Verlag. 1975. 115 S., DM 38,—. (Reihe: Verfahren der Datenverarbeitung) , 1978 .

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