Pages that link to "Item:Q5900907"
From MaRDI portal
The following pages link to Extended formulations in combinatorial optimization (Q5900907):
Displaying 50 items.
- The projected faces property and polyhedral relations (Q263204) (← links)
- Extended formulations for convex heptagons (Q265972) (← links)
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- New formulations for the elementary shortest-path problem visiting a given set of nodes (Q323412) (← links)
- Common information and unique disjointness (Q343843) (← links)
- Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
- Strong and compact relaxations in the original space using a compact extended formulation (Q458127) (← links)
- Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
- On the \({\mathcal {H}}\)-free extension complexity of the TSP (Q519756) (← links)
- Extended formulations for polygons (Q714985) (← links)
- Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
- Optimum turn-restricted paths, nested compatibility, and optimum convex polygons (Q724738) (← links)
- Smallest compact formulation for the permutahedron (Q745678) (← links)
- Tropical lower bounds for extended formulations (Q745680) (← links)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- Uncapacitated flow-based extended formulations (Q745688) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Complete formulations of polytopes related to extensions of assignment matrices (Q1662654) (← links)
- An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
- Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
- Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol (Q1686055) (← links)
- Compact extended linear programming models (Q1693865) (← links)
- Surveys in operations research (Q1730527) (← links)
- Extended formulations for order polytopes through network flows (Q1736010) (← links)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
- Combinatorial bounds on nonnegative rank and extended formulations (Q1759811) (← links)
- Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study (Q1789594) (← links)
- Extended formulations for vertex cover (Q1790198) (← links)
- A smaller extended formulation for the odd cycle inequalities of the stable set polytope (Q1983107) (← links)
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles (Q2042074) (← links)
- Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180) (← links)
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles (Q2118149) (← links)
- Complexity of linear relaxations in integer programming (Q2149550) (← links)
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
- Strategic bidding in price coupled regions (Q2155379) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- A correct response model in knowledge structure theory (Q2244625) (← links)
- Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
- Extended formulations for radial cones (Q2294359) (← links)
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- An upper bound for nonnegative rank (Q2341256) (← links)
- A generalization of extension complexity that captures P (Q2345857) (← links)
- Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
- Some \(0/1\) polytopes need exponential size extended formulations (Q2434987) (← links)
- The Steiner connectivity problem (Q2434988) (← links)
- Twelve surveys in operations research (Q2630815) (← links)