On permuting some coordinates of polytopes

DOI10.1007/978-3-031-18530-4_8zbMath1528.90230OpenAlexW4312711989MaRDI QIDQ6166894

Hans Raj Tiwary

Publication date: 3 August 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-18530-4_8

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The projected faces property and polyhedral relations
• On the extension complexity of combinatorial polytopes
• Geometric algorithms and combinatorial optimization
• Disjunctive programming: Properties of the convex hull of feasible points
• Exponential Lower Bounds for Polytopes in Combinatorial Optimization
• Constructing Extended Formulations from Reflection Relations
• Lectures on Polytopes
• Convex Polytopes
• Extension Complexity of Independent Set Polytopes
• The Matching Polytope has Exponential Extension Complexity
• The NP-completeness column: An ongoing guide
• Extended formulations in combinatorial optimization

This page was built for publication: On permuting some coordinates of polytopes