Pages that link to "Item:Q3002766"

The following pages link to Rank bounds and integrality gaps for cutting planes procedures (Q3002766):

Displaying 30 items.

• The limits of tractability in resolution-based propositional proof systems (Q408157) (← links)
• Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
• Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
• Cutting plane algorithms and approximate lower subdifferentiability (Q535075) (← links)
• Cutting planes and the parameter cutwidth (Q693047) (← links)
• Uncapacitated flow-based extended formulations (Q745688) (← links)
• Tight rank lower bounds for the Sherali-Adams proof system (Q1019183) (← links)
• On the Chvátal rank of the pigeonhole principle (Q1029351) (← links)
• Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
• Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (Q1947040) (← links)
• Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
• An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
• Exponential lower bounds for polytopes in combinatorial optimization (Q2796404) (← links)
• Convex Relaxations and Integrality Gaps (Q2802523) (← links)
• Hardness amplification in proof complexity (Q2875135) (← links)
• Rank of random half-integral polytopes. Extended abstract (Q2883588) (← links)
• Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures (Q2884578) (← links)
• Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
• Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines (Q3186499) (← links)
• Expander graphs and their applications (Q3514498) (← links)
• Cutting Planes and the Parameter Cutwidth (Q3576046) (← links)
• Resolution Width and Cutting Plane Rank Are Incomparable (Q3599159) (← links)
• Input Proofs and Rank One Cutting Planes (Q4018154) (← links)
• Stabbing planes (Q4993273) (← links)
• Superlinear Integrality Gaps for the Minimum Majority Problem (Q5020845) (← links)
• The Complexity of Propositional Proofs (Q5444711) (← links)
• (Q5467854) (← links)
• On polytopes with linear rank with respect to generalizations of the split closure (Q6122082) (← links)
• Depth lower bounds in Stabbing Planes for combinatorial principles (Q6137876) (← links)
• Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)