Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Computational and approximational complexity of combinatorial problems related to the committee polyhedral separability of finite sets


    Contributors:


    Publication date :

    2008-01-01


    Size :

    7 pages



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English


    Classification :

    DDC:    006.4




    Computational complexity of the minimal committee problem and adjacent problems

    Khachai, M. Y. | British Library Online Contents | 2006


    Enhancement of data separability in multisensor-multitarget tracking problems

    BALAKRISHNAN, S. N. / TAPLEY, B. D. / SCHUTZ, B. E. | AIAA | 1989


    Algorithms for Non-Separability Problems: The Departure Time Choice

    Verstraete, Jeroen / Tampère, Chris M. J. | TIBKAT | 2022

    Free access