|
|
|
|
|
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
|
|
|
|
|