Pages that link to "Item:Q2450664"

The following pages link to A note on the extension complexity of the knapsack polytope (Q2450664):

Displaying 29 items.

• Common information and unique disjointness (Q343843) (← links)
• Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
• On the \({\mathcal {H}}\)-free extension complexity of the TSP (Q519756) (← links)
• On the extension complexity of combinatorial polytopes (Q745682) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
• Simple extensions of polytopes (Q896292) (← links)
• Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
• Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
• Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
• Extended formulations for vertex cover (Q1790198) (← links)
• Extension of Hoshen-Kopelman algorithm to non-lattice environments (Q1867874) (← links)
• Computational aspects of relaxation complexity (Q2061898) (← links)
• Extended formulations for radial cones (Q2294359) (← links)
• Polynomial size linear programs for problems in \textsc{P} (Q2312647) (← links)
• A short proof that the extension complexity of the correlation polytope grows exponentially (Q2340413) (← links)
• A generalization of extension complexity that captures P (Q2345857) (← links)
• Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
• Computational aspects of relaxation complexity: possibilities and limitations (Q2689831) (← links)
• Exponential lower bounds for polytopes in combinatorial optimization (Q2796404) (← links)
• Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes (Q2817835) (← links)
• Easily Computable Facets of the Knapsack Polytope (Q3032082) (← links)
• (Q3840363) (← links)
• Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
• Small extended formulation for knapsack cover inequalities from monotone circuits (Q4612478) (← links)
• A SHORT NOTE ON THE REDUCIBILITY OF THE COLLAPSING KNAPSACK PROBLEM (Q4797034) (← links)
• Extension of Brickell’S Algorithm for Breaking High Density Knapsacks (Q5000237) (← links)
• (Q5089218) (← links)
• Forbidden Vertices (Q5252224) (← links)