Now showing items 1-5 of 5

    • DYNAMIC SHORTEST PATHS MINIMIZING TRAVEL TIMES AND COSTS ?

      Ahuja, Ravindra; Orlin, James; Pallottino, Stefano; Scutella, Maria (2003-01-27)
      In this paper, we study dynamic shortest path problems that determine a shortest path from a specified source node to every other node in the network where arc travel times change dynamically. We consider two problems: ...
    • Exact and Heuristic Methods for the Weapon Target Assignment Problem ?

      Ahuja, Ravindra; Kumar, Arvind; Jha, Krishna; Orlin, James (2004-12-10)
      The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so ...
    • SOLVING REAL-LIFE LOCOMOTIVE SCHEDULING PROBLEMS ?

      Ahuja, Ravindra; Liu, Jian; Orlin, James; Sharma, Dushyant; Shughart, Larry (2003-01-27)
      The locomotive scheduling problem (or the locomotive assignment problem) is to assign a consist (a set of locomotives) to each train in a pre-planned train schedule so as to provide them sufficient power to pull them ...
    • A Very Large-Scale Neighborhood Search Algorithm for the Combined Through and Fleet Assignment Model ?

      Ahuja, Ravindra; Goodstein, Jon; Mukherjee, Amit; Orlin, James; Sharma, Dushyant (2003-01-27)
      The fleet assignment model (FAM) for an airline assigns fleet types to the set of flight legs that satisfies a variety of constraints and minimizes the cost of the assignment. A through connection at a station is a connection ...
    • VERY LARGE-SCALE NEIGHBORHOOD SEARCH FOR THE QUADRATIC ASSIGNMENT PROBLEM ?

      Ahuja, Ravindra; Jha, Krishna; Orlin, James; Sharma, Dushyant (2003-01-27)
      The Quadratic Assignment Problem (QAP) consists of assigning n facilities to n locations so as to minimize the total weighted cost of interactions between facilities. The QAP arises in many diverse settings, is known to ...