Computational Aspects of Relaxation Complexity: Possibilities and Limitations
From MaRDI portal
Publication:6368587
DOI10.1007/s10107-021-01754-8zbMath1515.90070arXiv2105.12509MaRDI QIDQ6368587
Christopher Hojny, Gennadiy Averkov, Matthias Schymura
Publication date: 26 May 2021
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Integer programming (90C10) Mixed integer programming (90C11)
This page was built for publication: Computational Aspects of Relaxation Complexity: Possibilities and Limitations