On the extension complexity of combinatorial polytopes

DOI10.1007/978-3-642-39206-1_6MaRDI QIDQ6827075zbMATH OpenFDO

Authors David Avis, Hans Raj Tiwary

Publication date 6 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39206-1_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cited in

(2)

• A topological version of Schaefer's dichotomy theorem
• Sublinear extensions of polygons

This page was built for publication: On the extension complexity of combinatorial polytopes

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