The following pages link to (Q3892882):
Displaying 16 items.
- Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
- A note on node packing polytopes on hypergraphs (Q790042) (← links)
- New formulations for the uncapacitated multiple allocation hub location problem (Q818098) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- On the 0,1 facets of the set covering polytope (Q1122477) (← links)
- A generalization of antiwebs to independence systems and their canonical facets (Q1122478) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Rank inequalities and separation algorithms for packing designs and sparse triple systems. (Q1401311) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- On the facets of the simple plant location packing polytope (Q1850113) (← links)
- On the complete set packing and set partitioning polytopes: properties and rank 1 facets (Q2417173) (← links)
- (Q2861548) (← links)
- Some facets of the simple plant location polytope (Q3945954) (← links)
- New facets for the set packing polytope (Q5929145) (← links)
