Pages that link to "Item:Q5929145"

The following pages link to New facets for the set packing polytope (Q5929145):

Displaying 17 items.

• Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
• Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
• New formulations for the uncapacitated multiple allocation hub location problem (Q818098) (← links)
• Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
• The rank pricing problem: models and branch-and-cut algorithms (Q1722958) (← links)
• Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience (Q1725611) (← links)
• New valid inequalities and facets for the simple plant location problem (Q1749485) (← links)
• A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← 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)
• Dynamic node packing (Q2097666) (← links)
• A new lifting theorem for vertex packing (Q2329651) (← links)
• On the complete set packing and set partitioning polytopes: properties and rank 1 facets (Q2417173) (← links)
• A fast approximation algorithm for solving the complete set packing problem (Q2514810) (← links)
• New facets for the two-stage uncapacitated facility location polytope (Q2655408) (← links)
• The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
• New variants of the simple plant location problem and applications (Q6106762) (← links)