DSpace at MIT (28.953 recursos) This site is a university repository providing access to the publication output of the institution. Registered users can set up email alerts to notify them of newly added relevant content. A certain level of encryption and security is embedded in the site which may cause some users accessibility problems.
2. A Dual Ascent Procedure for Large Scale Uncapacitated Network Design - Balakrishnan, Anantaram; Magnanti, Thomas L.; Wong, Richard T. The fixed-charge network design problem arises in a variety of problem contexts including transportation, communication, and production scheduling.We develop a family of dual ascent algorithms for this problem.
6. Pup Matching: Model Formulations and Solution Approaches - Bossert, John M.; Magnanti, Thomas L. We model Pup Matching, the logistics problem of matching or pairing semitrailers known as pups to cabs that are able to tow one or two of the pups simultaneously, as an AfP-complete version of the Network Loading Problem (NLP).
16. Routing in Point-to-Point Delivery Systems - Leung, Janny M. Y.; Magnanti, Thomas L.; Singhal, Vijay This paper was also printed as a Working Paper at the Yale School of Organization and Management, Series B, No.
20. Computation of Minimum Volume Covering Ellipsoids - Sun, Peng; Freund, Robert M. Our computational results demonstrate that our method solves very large problem instances (m = 30, 000 and n = 30) to a high degree of accuracy in under 30 seconds on a personal computer.
1. 