Constructing extended formulations from reflection relations

DOI10.1007/978-3-642-20807-2_23MaRDI QIDQ3009770zbMATH OpenOpenAlexFDO

Authors Volker Kaibel, Kanstantsin Pashkovich

Publication date 24 June 2011

Published in Integer Programming and Combinatoral Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20807-2_23

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Constructing extended formulations from reflection relations
• Extended formulations in combinatorial optimization
• An algebraic approach to symmetric extended formulations
• Extended formulations in combinatorial optimization
• The projected faces property and polyhedral relations

Cites work

• Branched polyhedral systems
• Expressing combinatorial optimization problems by linear programs
• Extended formulations in combinatorial optimization
• scientific article; zbMATH DE number 47598 (Why is no real title available?)
• On Polyhedral Approximations of the Second-Order Cone
• On the convex hull of Huffman trees
• Polyhedral Characterization of Discrete Dynamic Programming
• Root systems and generalized associahedra
• Smallest compact formulation for the permutahedron
• Sorting in \(c \log n\) parallel steps
• Structure of a simple scheduling polyhedron
• Symmetry matters for the sizes of extended formulations

Cited in

(24)

• Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study
• Formalizing mirror theory
• Balas formulation for the union of polytopes is optimal
• An upper bound for nonnegative rank
• Extension complexities of Cartesian products involving a pyramid
• The projected faces property and polyhedral relations
• Mixed integer linear programming formulation techniques
• An algebraic approach to symmetric extended formulations
• Extension complexity, MSO logic, and treewidth
• Sparse sums of squares on finite abelian groups and improved semidefinite lifts
• Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
• Branched polyhedral systems
• Polytopes of minimum positive semidefinite rank
• On the linear description of the Huffman trees polytope
• Extension complexity of low-dimensional polytopes
• On the linear extension complexity of regular n-gons
• Tight lower bounds on the sizes of symmetric extensions of permutahedra and similar results
• Constructing extended formulations from reflection relations
• Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis
• Deriving compact extended formulations via LP-based separation techniques
• Extended formulations in combinatorial optimization
• Deriving compact extended formulations via LP-based separation techniques
• On permuting some coordinates of polytopes
• Extended formulations for polygons

This page was built for publication: Constructing extended formulations from reflection relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3009770)