Generalization of Barahona's algorithm for cases of integer non-linear programming with box constraints (Q2367400)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalization of Barahona's algorithm for cases of integer non-linear programming with box constraints |
scientific article |
Statements
Generalization of Barahona's algorithm for cases of integer non-linear programming with box constraints (English)
0 references
10 August 1993
0 references
A linear time algorithm for a class of 0-1 quadratic programming problems with box constraints and special quadratic function is described. It treats the problem directly without transforming into max-cut problem.
0 references
integer quadratic programming
0 references
series-parallel graphs
0 references
polynomial algorithms
0 references
pseudopolynomial algorithms
0 references
linear time algorithm
0 references
0-1 quadratic programming
0 references
box constraints
0 references
max-cut
0 references
