Combinatorial optimization problems related to the committee polyhedral separability of finite sets

DOI10.1134/S0081543808060102zbMath1178.90293MaRDI QIDQ735652

Vl. D. Mazurov, M. I. Poberii, Mikhail Yu. Khachay

Publication date: 23 October 2009

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Cites Work

• On the complexity of polyhedral separability
• On the complexity of locating linear facilities in the plane
• Unnamed Item

This page was built for publication: Combinatorial optimization problems related to the committee polyhedral separability of finite sets