|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2008, Volume 14, Number 2, Pages 89–102
(Mi timm27)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Mathematical Programming
Combinatorial optimization problems related to the committee polyhedral separability of finite sets
V. D. Mazurov, M. Yu. Khachai, M. I. Poberii
Abstract:
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.
Received: 28.02.2008
Citation:
V. D. Mazurov, M. Yu. Khachai, M. I. Poberii, “Combinatorial optimization problems related to the committee polyhedral separability of finite sets”, Trudy Inst. Mat. i Mekh. UrO RAN, 14, no. 2, 2008, 89–102; Proc. Steklov Inst. Math. (Suppl.), 263, suppl. 2 (2008), S93–S107
Linking options:
https://www.mathnet.ru/eng/timm27 https://www.mathnet.ru/eng/timm/v14/i2/p89
|
|