13 search results - page 1 / 3 » On separating cover inequalities for the multidimensional kn... |
COR
2007
14 years 10 months ago
2007
92
Voted
EOR
2008
14 years 10 months ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
85
Voted
MP
2010
14 years 8 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
77
Voted
MP
1998
14 years 10 months ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
77
Voted
MOR
2002
14 years 10 months ago
2002
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...