Generalization of Barahona's algorithm for cases of integer non-linear programming with box constraints

DOI10.1016/0167-6377(93)90036-GzbMath0776.90058OpenAlexW2033805840MaRDI QIDQ2367400

Ross Baldick

Publication date: 10 August 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90036-g

zbMATH Keywords

box constraints0-1 quadratic programmingpolynomial algorithmslinear time algorithmseries-parallel graphsmax-cutinteger quadratic programmingpseudopolynomial algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Dynamic programming (90C39) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization

Cites Work

• A solvable case of quadratic 0-1 programming
• The basic algorithm for pseudo-Boolean programming revisited
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalization of Barahona's algorithm for cases of integer non-linear programming with box constraints