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

DOI10.1134/S0081543808060102zbMATH Open1178.90293MaRDI QIDQ735652FDOQ735652

Vl. D. Mazurov, M. I. Poberii, M. Yu. Khachaĭ

Publication date: 23 October 2009

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

Mathematics Subject Classification ID

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

Cites Work

• On the complexity of polyhedral separability
• On the complexity of locating linear facilities in the plane
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
• Combinatorial methods in the study of marginal problems over separable spaces
• Polynomial-Time Separation of a Superclass of Simple Comb Inequalities

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735652)