UPS Optimizes Its Air Network

References

• Armacost Andrew P., Cynthia Barnhart, Ware Keith A. Composite variable formulations for express shipment service network design. Transportation Sci. (2002) 36(1):1–20Link, Google Scholar
• Barnhart Cynthia, Farahat Amr, Lohatepanont Manoj. Airline fleet assignment: An enhanced revenue model. (2002a) . Working paper, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Barnhart Cynthia, Krishnan Niranjan, Kim Daeki, Ware Keith A. Network design for express shipment delivery. Comput. Optim. Appl. (2002b) 21(3):239–262Crossref, Google Scholar
• Barrett Alexandra. Optimize the enterprise. Information Week Online. (2000) . Retrieved June 5 www.informationweek.com/789/ optimize.htmGoogle Scholar
• Barth Christopher D. Composite mission variable formulation for real-time mission planning. (2001) . Master’s thesis, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Clark Steven J., Barnhart Cynthia, Kolitz Stephan E. Largescale optimization planning methods for the distribution of United States Army munitions. Math. Comput. Modeling. (2004) . ForthcomingCrossref, Google Scholar
• Cohn Amy M., Barnhart Cynthia. Composite-variable modeling for service parts logistics. (2002) . Working paper, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Cohn Amy M., Barnhart Cynthia. Improving crew scheduling by incorporating key maintenance routing decisions. Oper. Res. (2003) 51(3):387–396Link, Google Scholar
• Crainic Teodor G. Service network design in freight transportation. Eur. J. Oper. Res. (2000) 122(2):272–288Crossref, Google Scholar
• Gendron Bernard, Crainic Teodor G., Frangioni Antonio, Sanso B., Soriano P. Multicommodity capacitated network design. Telecommunications Network Planning (1999) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 1–19Crossref, Google Scholar
• Günlük Oktay. A branch-and-cut algorithm for capacitated network design problems. Math. Programming (1999) 86(1):17–39Crossref, Google Scholar
• Hochbaum Dorit S., Naor Joseph. Approximation algorithms for network design problems. J. Algorithms (1996) 21(2):403–414Crossref, Google Scholar
• Karger David R. Random sampling in cut, flow, and network design problems. Math. Oper. Res. (1999) 24(2):383–413Link, Google Scholar
• Kim Daeki, Barnhart C., Ware Keith A., Reinhardt G. Multimodal express package delivery: A service network design approach. Transportation Sci. (1999) 33(4):391–407Link, Google Scholar
• Magnanti Thomas L., Wong Richard T. Network design and transportation planning: Models and algorithms. Transportation Sci. (1984) 18(1):1–55Link, Google Scholar
• Magnanti Thomas L., Mirchandani Prakash, Vachani Rita. Modeling and solving the two-facility capacitated network loading problem. Oper. Res. (1995) 43(1):142–157Link, Google Scholar
• McGuire Patrick. Planning made simpler. Business Week (2000) October 30):174B–174DGoogle Scholar
• Nielsen Christopher A., Armacost Andrew P., Barnhart Cynthia, Kolitz Stephan E. Network design formulations for scheduling U.S. Air Force channel route missions. Math. Comput. Modeling. (2004) . ForthcomingCrossref, Google Scholar
• Stallaert Jan. Valid inequalities and separation for capacitated fixed charge flow problems. Discrete Appl. Math. (2000) 98(3):265–274Crossref, Google Scholar
• 2001UPS Press ReleaseGoogle Scholar
• Van Roy Tony J., Wolsey Laurence A. Valid inequalities and separation for uncapacitated fixed charge networks. Oper. Res. Lett. (1985) 4(3):105–112Crossref, Google Scholar