Duality in Discrete Programming: II. The Quadratic Case

DOI10.1287/mnsc.16.1.14zbMath0191.48202OpenAlexW2168909214MaRDI QIDQ5585872

Egon 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

Related Items (13)

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

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