Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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



    Conference:

    Conference, AIAA Infotech@aerospace ; 2012 ; Garden Grove, CA



    Publication date :

    2012-01-01


    Size :

    12 pages


    Remarks:

    Includes bibliographical references and index



    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English






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

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


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

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


    Traveling Salesman Problems with Profits

    Feillet, Dominique | Online Contents | 2005