On some polyhedra covering problems

DOI10.1023/A:1009833410742zbMath1028.90088OpenAlexW1599901748MaRDI QIDQ1592841

Boting Yang, Cao An Wang, Binhai Zhu

Publication date: 25 January 2001

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009833410742

zbMATH Keywords

NP-hardcomputational geometrypolyhedra covering

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

This page was built for publication: On some polyhedra covering problems