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

DOI10.1134/S0081543808060102MaRDI QIDQ735652zbMATH OpenFDO

Authors 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

• scientific article; zbMATH DE number 3700567 (Why is no real title available?)
• On the complexity of locating linear facilities in the plane
• On the complexity of polyhedral separability

Cited in

(5)

• scientific article; zbMATH DE number 5592483 (Why is no real title available?)
• scientific article; zbMATH DE number 5598224 (Why is no real title available?)
• 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)