Models and methods of solution of quadratic integer programming problems

[1]  E. Beale.  On quadratic proramming , 1959 .

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

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

[4]  C. E. Lemke,et al.  Equilibrium Points of Bimatrix Games , 1964 .

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

[6]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

[7]  R. J. Dakin,et al.  A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..

[8]  H. Weingartner.  Capital Budgeting of Interrelated Projects: Survey and Synthesis , 1966 .

[9]  E. L. Lawler,et al.  A Method for Solving Discrete Optimization Problems , 1966, Oper. Res..

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

[11]  Lawrence J. Watters.  Letter to the Editor - Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems , 1967, Oper. Res..

[12]  Egon Balas.  DUALITY IN DISCRETE PROGRAMMING , 1967 .

[13]  James C. T. Mao,et al.  An Extension of Lawler and Bell's Method of Discrete Optimization with Examples from Capital Budgeting , 1968 .

[14]  Egon Balas,et al.  Duality in Discrete Programming: II. The Quadratic Case , 1969 .

[15]  D. J. Laughhunn.  Quadratic Binary Programming with Application to Capital-Budgeting Problems , 1970, Oper. Res..

[16]  A. Victor Cabot,et al.  Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points , 1970, Oper. Res..

[17]  B. Eaves.  On Quadratic Programming , 1971 .

[18]  Harvey J. Greenberg,et al.  A Review of Quasi-Convex Functions , 1971, Oper. Res..

[19]  Dan J. Laughhunn,et al.  Capital Expenditure Programming and Some Alternative Approaches to Risk , 1971 .

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

[21]  A. Land,et al.  An Inverse-Basis Method for Beale's Quadratic Programming Algorithm , 1973 .

[22]  S. C. Agrawal.  On mixed integer quadratic programs , 1974 .

[23]  S. C. Agrawal.  On integer solutions to quadratic programs by a branch and bound technique , 1974 .

[24]  F. Glover.  IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS , 1975 .

[25]  Ta Huu Phuong.  Solution of Integer Programs with a Quadratic Objective Function , 1976, JACM.

[26]  S. C. Agrawal.  An alternate method on integer solutions to quadratic programs by a branch and bound technique , 1976 .

[27]  Universality of a class of quadratic integer problems , 1977 .

[28]  J. Tomlin.  Robust implementation of Lemke's method for the linear complementarity problem , 1978 .

[29]  Jonathan S. Yormark,et al.  Optimal Real Estate Portfolios , 1979 .

[30]  Richard D. McBride,et al.  Finding All Solutions for a Class of Parametric Quadratic Integer Programming Problems , 1980 .

[31]  R. McBride,et al.  An Implicit Enumeration Algorithm for Quadratic Integer Programming , 1980 .

[32]  P. Hammer,et al.  Quadratic knapsack problems , 1980 .

[33]  Roland Sessner.  Die direkte Suche - ein heuristisches Verfahren zur Behandlung ganzzahliger quadratischer Optimierungsprobleme , 1980 .

[34]  M. W. Cooper.  A Survey of Methods for Pure Nonlinear Integer Programming , 1981 .

[35]  Hiroshi Konno.  AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS , 1981 .

[36]  J. C. Hennet,et al.  Resolution of a quadratic combinatorial problem by dynamic programming , 1982 .

[37]  Rafael Lazimy,et al.  Mixed-integer quadratic programming , 1982, Math. Program..

[38]  Mary W. Cooper,et al.  Nonlinear integer programming for various forms of constraints , 1982 .

[39]  Claus Richter,et al.  Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen , 1982 .

[40]  R. Burkard,et al.  A heuristic for quadratic Boolean programs with applications to quadratic assignment problems , 1983 .

[41]  Michael W. Carter,et al.  The indefinite zero-one quadratic problem , 1984, Discret. Appl. Math..

[42]  A. K. Mittal,et al.  Unconstrained quadratic bivalent programming problem , 1984 .

[43]  Lu Shi Hui.  An improved enumerative algorithm for solving quadratic zero-one programming , 1984 .

[44]  B. Bank,et al.  Stability of mixed-integer quadratic programming problems , 1984 .

[45]  Frank Körner,et al.  Integer quadratic optimization , 1985 .

[46]  F. Körner.  Ein effektiver Branch and Bound‐Algorithmus für Boolesche quadratische Optimierungsprobleme , 1985 .

[47]  Rafael Lazimy,et al.  Improved algorithm for mixed-integer quadratic programs and a computational study , 1985, Math. Program..