Computational and approximational complexity of combinatorial problems related to the committee polyhedral separability of finite sets
01.01.2008
7 pages
Aufsatz (Zeitschrift)
Englisch
DDC: | 006.4 |
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
British Library Online Contents | 2012
|Computational complexity of the minimal committee problem and adjacent problems
British Library Online Contents | 2006
|Large-scale vehicle routine and related combinatorial problems
TIBKAT | 1976
|