A family of easy polyhedra

DOI10.1007/s10288-008-0079-3zbMath1186.68508OpenAlexW1996049979MaRDI QIDQ1040728

Jean-Francois Maurras

Publication date: 25 November 2009

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-008-0079-3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
• The ellipsoid method and its consequences in combinatorial optimization
• Geometric algorithms and combinatorial optimization
• Cropped cubes

This page was built for publication: A family of easy polyhedra