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

Authors:
Ross Baldick
Affiliations:
Lawrence Berkeley laboratory, Berkeley, CA 94720, USA
Venue:
Operations Research Letters
Year:
1993

Citing 3
Cited 0

A solvable case of quadratic 0-1 programming

Discrete Applied Mathematics
The basic algorithm for pseudo-Boolean programming revisited

Selected papers on First international colloquium on pseudo-boolean optimization and related topics
Principles of Dynamic Programming: Basic Analytical and Computational Methods

Principles of Dynamic Programming: Basic Analytical and Computational Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

Barahona described a linear time algorithm for a class of 0-1 quadratic programming problems. The algorithm was based on a transformation to a max-cut problem. We describe a linear algorithm that treats a slightly more general problem directly in its original form. We then give a pseudopolynomial algorithm for even more general problems.