Pages that link to "Item:Q2386210"

The following pages link to Tree-width and the Sherali-Adams operator (Q2386210):

Displaying 20 items.

• Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
• Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
• On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
• Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
• Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
• On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
• Approximating graph-constrained max-cut (Q1800989) (← links)
• Worst-case analysis of clique MIPs (Q2089781) (← links)
• New limits of treewidth-based tractability in optimization (Q2118087) (← links)
• A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← links)
• Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
• Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
• Approximate fixed-rank closures of covering problems (Q2583148) (← links)
• Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
• Max-Cut Under Graph Constraints (Q3186491) (← links)
• PEBBLE GAMES AND LINEAR EQUATIONS (Q3450805) (← links)
• LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
• The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
• (Q5075740) (← links)
• A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time (Q6589758) (← links)