The simplest families of polytopes associated with NP-hard problems
From MaRDI portal
Publication:2353062
DOI10.1134/S1064562415010160zbMath1320.52012MaRDI QIDQ2353062
Publication date: 7 July 2015
Published in: Doklady Mathematics (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
90C10: Integer programming
90C27: Combinatorial optimization
Related Items
Cites Work
- On certain polytopes associated with graphs
- On affine reducibility of combinatorial polytopes
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation
- Exact Algorithms for the Quadratic Linear Ordering Problem
- Linear vs. semidefinite extended formulations
- Geometry of cuts and metrics
- Unnamed Item