An implicit branch-and-bound algorithm for mixed-integer linear programming (Q804472): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0305-0548(90)90050-h / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008600006 / rank | |||
Normal rank | |||
Latest revision as of 09:09, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An implicit branch-and-bound algorithm for mixed-integer linear programming |
scientific article |
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
