A nested decomposition method for vehicle routing and scheduling
Includes bibliographical references (p. 31-32).
Other Authors: | Lee, Anthony Owen |
---|---|
Language: | eng |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/5304 |
Similar Items
Similar Items
-
A distributed Poisson approximation for preempt-resume clocked schedules
Published: (2004) -
An analog of Karmarkar's algorithm for inequality constrained linear programs, with a "new" class of projective transformations for centering a polytope
Published: (2004) -
A fast and simple algorithm for the maximum flow problem
Published: (2004) -
An analytic approach to a general class of G/G/s queueing systems
Published: (2004) -
An exact FCFS waiting-time analysis for a general class of G/G/s queueing systems
Published: (2004)