Search Results - ASCHEUER, N

  • Showing 1 - 5 results of 5
Refine Results
  1. 1
    Solving the Asymmetric Travelling salesman problem with time windows by branch-and-cut

    Solving the Asymmetric Travelling salesman problem with time windows by branch-and-cut by ASCHEUER, Norbert, FISCHETTI, Matteo, GRÖTSCHEL, Martin

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

    A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints by Ascheuer, Norbert, Junger, Michael, Reinelt, Gerhard

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 3
    A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)

    A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) by Ascheuer, N., Escudero, L. F., Grötschel, M., Stoer, M.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  4. 4
    A polyhedral study of the asymmetric traveling salesman problem with time windows

    A polyhedral study of the asymmetric traveling salesman problem with time windows by Ascheuer, Norbert, Fischetti, Matteo, Grötschel, Martin

    Published in Networks
    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  5. 5
    Order picking in an automatic warehouse : Solving online asymmetric TSPs

    Order picking in an automatic warehouse : Solving online asymmetric TSPs by ASCHEUER, N, GRÖTSCHEL, M, ABDEL-HAMID, A. A.-A

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:

Search Tools: