Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:

    Conference:

    AIAA Infotech@Aerospace (I@A) Conference



    Publication date :

    2013-01-01



    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    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



    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


    A Market-Based Solution to the Multiple Depots, Multiple Traveling Salesmen Problem with Profits

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