Mixed-integer quadratic programming (original) (raw)
Access this article
Subscribe and save
- Starting from 10 chapters or articles per month
- Access and download chapters and articles from more than 300k books and 2,500 journals
- Cancel anytime View plans
Buy Now
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
Instant access to the full article PDF.
References
- R.D. Armstrong and C. E. Willis, “Simultaneous investment and allocation decisions applied to water planning”,Management Science 23 (1977) 1080–1087.
Google Scholar - E. Balas, “Duality in discrete programming: II. The quadratic case”,Management Science 16 (1969) 14–32.
Google Scholar - M.S. Bazaraa and H.D. Sherali, “Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem”,Naval Research Logistics Quarterly 27 (1980) 29–41.
Google Scholar - E.M.L. Beale, “On minimizing a convex function subject to linear inequalities”,Journal of the Royal Statistical Society (B) 17 (1955) 173–184.
Google Scholar - A. Ben-Israel and T.N.E. Greville,Generalized inverses: Theory and applications (Wiley, New York, 1974).
Google Scholar - J.F. Benders, “Partitioning procedures for solving mixed variable programming problems”,Numerische Mathematik 4 (1962) 238–252.
Google Scholar - R.W. Cottle, “Symmetric dual quadratic programs”,Quarterly of Applied Mathematics 21 (1963) 237–243.
Google Scholar - J.B. Dennis,Mathematical programming and electrical networks (Technology Press, Cambridge, MA, 1959).
Google Scholar - W.S. Dorn, “Duality in quadratic programming”,Quarterly of Applied Mathematics 18 (1960) 155–162.
Google Scholar - R.S. Garfinkel and G.L. Nemhauser,Integer programming (Wiley, New York, 1972).
Google Scholar - A.M. Geoffrion, “Elements of large-scale mathematical programming”,Management Science 16 (1970) 652–691.
Google Scholar - A.M. Geoffrion, “Generalized Benders' decomposition”,Journal of Optimization Theory and Applications 10 (1972) 237–260.
Google Scholar - A.M. Geoffrion and G.W. Graves, “Multicommodity distribution system design by Benders' decomposition”,Management Science 20 (1974) 822–844.
Google Scholar - A.M. Geoffrion and R.E. Marsten, “Integer programming: A framework and state-of-the-art survey”,Management Science 18 (1972) 465–491.
Google Scholar - F. Glover, “A pseudo primal dual integer programming algorithm”,Journal of Research of the National Bureau of Standards 71B (1967) 187–195.
Google Scholar - F. Glover, “Further reduction of zero–one polynomial programming problems to zero–one linear programming problems”,Operations Research 21 (1973) 156–161.
Google Scholar - F. Glover and R.E. Woolsey, “Converting the 0–1 polynomial programming problem to a 0–1 linear program”,Operations Research 22 (1974) 180–182.
Google Scholar - F. Glover, “Improved linear integer programming formulations of nonlinear integer problems”,Management Science 22 (1975) 445–460.
Google Scholar - R.E. Gomory, “All-integer programming algorithm”, in: J.F. Muth and G.L. Thompson, eds.,Industrial scheduling (Prentice Hall, Englewood Cliffs, NJ, 1963).
Google Scholar - P. Hansen, “Quadratic zero–one programming by implicit enumeration”, in: F.A. Lootsma, ed.,Numerical methods in nonlinear optimization (Academic Press, New York, 1972) pp. 265–278.
Google Scholar - H.P. Kunzi and W. Oettli, “Integer quadratic programming”, in: R.L. Graves and P. Wolfe, eds.,Recent advances in mathematical programming (McGraw Hill, New York, (1963) pp. 303–308.
Google Scholar - L.S. Lasdon,Optimization theory for large systems (The Macmillan Company, New York, 1970).
Google Scholar - C.E. Lemke, “A method for solution of quadratic programs”,Management Science 8 (1962) 442–453.
Google Scholar - J.C. Mao and B. A. Wallingford, “An extension of Lawler and Bell's method of discrete optimization with examples from capital budgeting”,Management Science 15 (1969) 851–860.
Google Scholar - R.D. McBride and J. S. Yormark, “An implicit enumeration algorithm for quadratic integer programming”,Management Science 26 (1980) 282–296.
Google Scholar - R. Penrose, “A generalized inverse for matrices”,Proceedings of the Cambridge Philosophical Society 51 (1955) 406–413.
Google Scholar - L.G. Watters, “Reduction of integer polynomial problems to zero–one linear programming problems”,Operations Research 15 (1967) 1171–1174.
Google Scholar - P. Wolfe, “The simplex method for quadratic programming”,Econometrica 27 (1959) 382–389.
Google Scholar