Duality in Discrete Programming: II. The Quadratic Case

DOI10.1287/MNSC.16.1.14zbMATH Open0191.48202OpenAlexW2168909214MaRDI QIDQ5585872FDOQ5585872

Authors: E. Balas 

Publication date: 1969

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.16.1.14

zbMATH Keywords

operations research

Cited In (13)

• Mixed-integer quadratic programming
• A note on Benders' decomposition in mixed-integer quadratic programming
• The indefinite zero-one quadratic problem
• Mixed-integer bilinear programming problems
• An algorithm for indefinite integer quadratic programming
• Two-stage quadratic integer programs with stochastic right-hand sides
• An exact penalty function approach for nonlinear integer programming problems
• An enumerative algorithm framework for a class of nonlinear integer programming problems
• Nonlinear 0–1 programming: I. Linearization techniques
• Dorn's duality for quadratic programs revisited: The nonconvex case
• Models and methods of solution of quadratic integer programming problems
• A duality theorem and an algorithm for (mixed-) integer nonlinear programming
• A simple procedure for solving a continuous quadratic mathematical model.

This page was built for publication: Duality in Discrete Programming: II. The Quadratic Case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5585872)