Combinatorial optimization problems related to the committee polyhedral separability of finite sets
Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 14 (2008) no. 2, pp. 89-102
Voir la notice de l'article provenant de la source Math-Net.Ru
In the paper, the computational and approximational complexity of the minimal affine separating committee problem, as well as of some important special cases of this problem, is investigated.
@article{TIMM_2008_14_2_a9,
author = {V. D. Mazurov and M. Yu. Khachai and M. I. Poberii},
title = {Combinatorial optimization problems related to the committee polyhedral separability of finite sets},
journal = {Trudy Instituta matematiki i mehaniki},
pages = {89--102},
publisher = {mathdoc},
volume = {14},
number = {2},
year = {2008},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TIMM_2008_14_2_a9/}
}
TY - JOUR AU - V. D. Mazurov AU - M. Yu. Khachai AU - M. I. Poberii TI - Combinatorial optimization problems related to the committee polyhedral separability of finite sets JO - Trudy Instituta matematiki i mehaniki PY - 2008 SP - 89 EP - 102 VL - 14 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/TIMM_2008_14_2_a9/ LA - ru ID - TIMM_2008_14_2_a9 ER -
%0 Journal Article %A V. D. Mazurov %A M. Yu. Khachai %A M. I. Poberii %T Combinatorial optimization problems related to the committee polyhedral separability of finite sets %J Trudy Instituta matematiki i mehaniki %D 2008 %P 89-102 %V 14 %N 2 %I mathdoc %U http://geodesic.mathdoc.fr/item/TIMM_2008_14_2_a9/ %G ru %F TIMM_2008_14_2_a9
V. D. Mazurov; M. Yu. Khachai; M. I. Poberii. Combinatorial optimization problems related to the committee polyhedral separability of finite sets. Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 14 (2008) no. 2, pp. 89-102. http://geodesic.mathdoc.fr/item/TIMM_2008_14_2_a9/