2 search results - page 1 / 1 » Separation algorithms for 0-1 knapsack polytopes |
MP
2010
13 years 3 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...
MP
2010
12 years 11 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...