On some polyhedra covering problems

DOI10.1023/A:1009833410742zbMath1028.90088MaRDI 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-hard; computational geometry; polyhedra covering

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C60: Abstract computational complexity for mathematical programming problems

90C27: Combinatorial optimization

52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)