Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function

DOI10.1137/040606193zbMath1165.90577OpenAlexW1985076878WikidataQ57445490 ScholiaQ57445490MaRDI QIDQ3440214

No author found.

Publication date: 22 May 2007

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/040606193

zbMATH Keywords

Lagrangian relaxation nonlinear integer programming duality theory quadratic integer programming objective contour cut

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)

Related Items (10)

A new exact algorithm for concave knapsack problems with integer variables ⋮ A new algorithm for quadratic integer programming problems with cardinality constraint ⋮ Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach ⋮ An exact algorithm for linear integer programming problems with distributionally robust chance constraints ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming ⋮ Distance confined path problem and separable integer programming

This page was built for publication: Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function