42 search results - page 1 / 9 » Cover and Pack Inequalities for (Mixed) Integer Programming |
ANOR
2005
13 years 4 months ago
2005
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
MOR
2010
13 years 3 months ago
2010
We consider the mixed integer version of bipartite vertex cover. This is equivalent to the mixed integer network dual model, recently introduced in [2], that generalizes several m...
INFORMS
2010
13 years 2 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...
DISOPT
2007
13 years 4 months ago
2007
We present a scheme for generating new valid inequalities for mixed integer programs by taking pairwise combinations of existing valid inequalities. Our scheme is related to mixed...
DC
2011
12 years 4 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...