Sparktope: linear programs from algorithms

DOI10.1080/10556788.2020.1864370zbMath1502.90110arXiv2005.02853OpenAlexW3119190706MaRDI QIDQ5043848

David Bremner, David Avis

Publication date: 6 October 2022

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.02853

zbMATH Keywords

linear programmingpolytopesmakespanmaximum matchingextension complexity

Mathematics Subject Classification ID

Linear programming (90C05) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (1)

Sparktope

Cites Work

• Unnamed Item
• Unnamed Item
• Reducibility by algebraic projections
• Using separation algorithms to generate mixed integer model reformulations
• Polynomial size linear programs for problems in \textsc{P}
• On the extension complexity of scheduling polytopes
• Exponential Lower Bounds for Polytopes in Combinatorial Optimization
• A Dynamic Programming Approach to Sequencing Problems
• The Matching Polytope has Exponential Extension Complexity
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• Geometry of cuts and metrics

This page was built for publication: Sparktope: linear programs from algorithms