|
|
|
|
|
Elias Munapo
Pág. 6 - 10
The paper presents a new method for solving the 0?1 linear programming problems (LPs). The general 0?1 LPs are believed to be NP-hard and a consistent, efficient general-purpose algorithm for these models has not been found so far. Cutting planes an...
ver más
|
|
|
|
|
|
|
|
|
|
|
Elias Munapo
Pág. 59 - 69
The paper presents a new reformulation approach to reduce the complexity of a branch and bound algorithm for solving the knapsack linear integer problem. The branch and bound algorithm in general relies on the usual strategy of first relaxing the integer...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kanat Abdukhalikov; Rudolf Scharlau
Pág. 387 - 403
|
|
|
|
|
|
|
|
|
|
|
J. E. Cremona
Pág. 1639 - 1652
|
|
|
|
|
|
|
|
|
|
|
Denis Simon
Pág. 1531 - 1543
|
|
|
|
|
|
|
|
|
|
|
Bannai, E; Dougherty, S T; Harada, M; Oura, M
Pág. 1194 - 1205
|
|
|
|
|
|