Pages that link to "Item:Q4443075"
From MaRDI portal
The following pages link to Facet Obtaining Procedures for Set Packing Problems (Q4443075):
Displaying 13 items.
- Strengthening the reliability fixed-charge location model using clique constraints (Q337553) (← links)
- Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
- Stochastic set packing problem (Q713096) (← links)
- Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience (Q1725611) (← links)
- A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756) (← links)
- On the facets of the simple plant location packing polytope (Q1850113) (← links)
- A new lifting theorem for vertex packing (Q2329651) (← links)
- On the facets of lift-and-project relaxations under graph operations (Q2448871) (← links)
- New facets for the two-stage uncapacitated facility location polytope (Q2655408) (← links)
- A New Facet Generating Procedure for the Stable Set Polytope (Q2840706) (← links)
- New facets for the set packing polytope (Q5929145) (← links)
- New variants of the simple plant location problem and applications (Q6106762) (← links)
