350 search results - page 2 / 70 » Separation of Partition Inequalities |
MOR
2006
13 years 6 months ago
2006
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the t...
IPCO
1996
13 years 7 months ago
1996
This paper attempts to provide a better understanding of the facial structure of polyhedra previously investigated separately. It introduces the notion of transitive packing and th...
MP
1998
13 years 5 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...
MP
2010
13 years 4 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...
INFORMS
2010
13 years 3 months ago
2010
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...