An implicit branch-and-bound algorithm for mixed-integer linear programming (Q804472)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An implicit branch-and-bound algorithm for mixed-integer linear programming |
scientific article; zbMATH DE number 4202025
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An implicit branch-and-bound algorithm for mixed-integer linear programming |
scientific article; zbMATH DE number 4202025 |
Statements
An implicit branch-and-bound algorithm for mixed-integer linear programming (English)
0 references
1990
0 references
The authors present a branch-and-bound algorithm for solving the general mixed-integer linear programming problem of the form max \(c^ Tx\), subject to \(Ax=b\), \(x\geq 0\) and \(x_ j\) integer for \(j\in I\). Some numerical results are given.
0 references
branch-and-bound
0 references
0.9483107
0 references
0.93774104
0 references
0.9352013
0 references
0.92940366
0 references
0.9258785
0 references
0.92258775
0 references
0.9165939
0 references
