Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A Binary Programming Solution to the Min-Max Multiple-Depots, Multiple Traveling Salesman Problem (AIAA 2013-4665)



    Kongress:

    Conference, Infotech@aerospace ; 2013 ; Boston, MA



    Erscheinungsdatum :

    01.01.2013


    Format / Umfang :

    11 pages


    Anmerkungen:

    Includes bibliographical references and index



    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Print


    Sprache :

    Englisch




    A Binary Programming Solution to the Min-Max Multiple-Depots, Multiple Traveling Salesman Problem

    Kivelevitch, Elad H. / Cohen, Kelly / Kumar, Manish | AIAA | 2013


    A Market-Based Solution to the Multiple Depots, Multiple Traveling Salesmen Problem with Profits (AIAA 2013-4666)

    Kivelevitch, E.H. / Cohen, K. / Kumar, M. et al. | British Library Conference Proceedings | 2013



    2012-2563 A Binary Programming Solution to the Multiple-Depot, Multiple Traveling Salesman Problem with Constant Profits

    Kivelevitch, E. / Cohen, K. / Kumar, M. et al. | British Library Conference Proceedings | 2012


    Enhanced Approaches to Solving the Multiple Traveling Salesman Problem (AIAA 2015-0889)

    Boone, Nathan / Sathyan, Anoop / Cohen, Kelly | British Library Conference Proceedings | 2015