Pages that link to "Item:Q1917353"

The following pages link to Tighter representations for set partitioning problems (Q1917353):

Displaying 16 items.

• Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
• Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
• Complementary column generation and bounding approaches for set partitioning formulations (Q1001332) (← links)
• On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
• A concurrent processing framework for the set partitioning problem (Q1603333) (← links)
• Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
• RLT insights into lift-and-project closures (Q2257076) (← links)
• Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
• On the complete set packing and set partitioning polytopes: properties and rank 1 facets (Q2417173) (← links)
• Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
• A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
• Compact linearization for binary quadratic problems (Q2477615) (← links)
• A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
• OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM (Q2874033) (← links)
• Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
• BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS (Q5168421) (← links)