Operations Research Center Working Papers: Recent submissions

Now showing items 175-177 of 372

    • Sensitivity Analysis of List Scheduling Heuristics 

      Kolen, A.W. J.; Rinnooy Kan, A. H. G.; Van Hoesel, C. P. M.; Wagelmans, Albert (Massachusetts Institute of Technology, Operations Research Center, 1990-10)
      When jobs have to be processed on a set of identical parallel machines so as to minimize the makespan of the schedule, list scheduling rules form a popular class of heuristics. The order in which jobs appear on the list ...

    • Improved time bounds for the maximum flow problem 

      Ahuja, Ravindra K., 1956-; Orlin, James B., 1953-; Tarjan, Robert E., 1948-; Massachusetts Institute of Technology. Operations Research Center; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1988)

    • A Faster Primal Network Simplex Algorithm 

      Aggarwal, Charu C.; Kaplan, Haim; Tarjan, Robert E., 1948- (Massachusetts Institute of Technology, Operations Research Center, 1996-03)
      We present a faster implementation of the polynomial time primal simplex algorithm due to Orlin [23]. His algorithm requires O(nm min{log(nC), m log n}) pivots and O(n2 m ??n{log nC, m log n}) time. The bottleneck operations ...