Pages that link to "Item:Q5900907"
From MaRDI portal
The following pages link to Extended formulations in combinatorial optimization (Q5900907):
Displaying 30 items.
- Exponential lower bounds for polytopes in combinatorial optimization (Q2796404) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- Extension complexity of polytopes with few vertices or facets (Q2835841) (← links)
- Extended Formulation Lower Bounds via Hypergraph Coloring (Q2955024) (← links)
- Constructing Extended Formulations from Reflection Relations (Q3009770) (← links)
- The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions (Q4592948) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- Small extended formulation for knapsack cover inequalities from monotone circuits (Q4612478) (← links)
- Symmetry Matters for Sizes of Extended Formulations (Q4899066) (← links)
- Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles (Q5041752) (← links)
- Regular Matroids Have Polynomial Extension Complexity (Q5076712) (← links)
- Distributionally Robust Linear and Discrete Optimization with Marginals (Q5095178) (← links)
- Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
- Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program (Q5231683) (← links)
- Tight Lower Bounds on the Sizes of Symmetric Extensions of Permutahedra and Similar Results (Q5247623) (← links)
- Forbidden Vertices (Q5252224) (← links)
- Advances in Combinatorial Optimization (Q5744058) (← links)
- A Polyhedral Characterization of Border Bases (Q5744696) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)
- Extended formulations from communication protocols in output-efficient time (Q5918910) (← links)
- Extended formulations in combinatorial optimization (Q5919994) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- A Unified Framework for Pricing in Nonconvex Resource Allocation Games (Q6114782) (← links)
- Scheduling-location problem with drones (Q6495369) (← links)
- Extended formulations via decision diagrams (Q6591617) (← links)
- Generalized Nash equilibrium problems with mixed-integer variables (Q6665384) (← links)