Composite Variable Formulations for Express Shipment Service Network Design

References

• Agrawal A., Klein P., Ravi R. When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM J. Comput. (1995) 24:440–456Crossref, Google Scholar
• Armacost A. P., Barnhart C., Ware K. A., Wilson A. M., DuPuy W. C. Planning the United Parcel Serivce air network. (2002) . Forthcoming, InterfacesGoogle Scholar
• Barahona F. Network design using cut inequalities. SIAM J. Optim. (1996) 6:823–837Crossref, Google Scholar
• Barnhart C., Schneur R. R. Air network design for express shipment service. Oper. Res. (1996) 44:852–863Link, Google Scholar
• Barnhart A. Farahat, Lohatepanotot M. Extending fleet assignment models and algorithms. (2000) . Working paper, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Bertsimas D., Teo C. P. From valid inequalities to heuristics: A unified view of primal-dual approximation algorithms in covering problems. Oper. Res. (1998) 46:503–514Link, Google Scholar
• Bienstock D., Günlük O. Computational experience with a difficult mixed-integer multicommodity flow problem. Math. Programming (1995) 68:213–237Crossref, Google Scholar
• Bienstock D., Günlük O. Capacitated network design-Polyhedral structure and computation. INFORMS J. Comput. (1996) 8:243–259Link, Google Scholar
• Bienstock S. Chopra, Günlük O., Tsai C. Y. Minimum cost capacity installation for multicommodity networks. Math. Programming (1998) 81:177–199Crossref, Google Scholar
• Büdenbender K., Grünert T., Sebastian H-J. A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem. Transportation Sci. (2000) 34:364–380Link, Google Scholar
• Chopra S., Gilboa L., Sastry S. T. Source sink flows with capacity installation in batches. Discrete Appl. Math. (1998) 85:165–192Crossref, Google Scholar
• Crainic T. G. Service network design in freight transportation. Eur. J., Oper. Res. (2000) 122:272–288Crossref, Google Scholar
• Crowder H., Johnson E. L., Padberg M. W. Soving large-scale zero-one linear programming problems. Oper. Res. (1983) 31:803–834Link, Google Scholar
• Gabow H. N., Goemans M. X., Williamson D. P. An Efficient approximation algorithm for the survivable network design problem. Math. Programming (1998) 82:13–40Crossref, Google Scholar
• Gendron B., Crainic T. G., Frangioni A., Sanso B., Soriano P. Multicommodity capacitated network design. Telecommunications Network Planning (1999) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 1–19Crossref, Google Scholar
• Goemans M. X., Bertsimas D. J. Survivable networks, linear programming relaxations and the parsimonious property. Math. Programming (1993) 60:145–166Crossref, Google Scholar
• Goemans, Williamson D. P. A general approximation technique for constrained forest problems. SIAM J. Comput. (1995) 24:296–317Crossref, Google Scholar
• Grünert T., Sebastian H. J. Planning models for long-haul operations of postal and express shipment companies. Eur. J., Oper. Res. (2000) 122:289–309Crossref, Google Scholar
• Günlük O. A branch-and-cut algorithm for capacitated network design problems. Math. Programming (1999) 86:17–39Crossref, Google Scholar
• Hochbaum D. S., Naor J. S. Approximation algorithms for network design problems on bounded subsets. J. Algorithms (1996) 21:403–414Crossref, Google Scholar
• ILOGCPLEX 6.5 User's Manual (1999) (ILOG, Inc., Incline Village, NV) Google Scholar
• Jain K. A factor 2 approximation algorithm for the generalized Steiner network problem. (1998) Proc. 39th Annual Sympos. on Foundations of Computer Science (FOCS '98)Crossref, Google Scholar
• Karger D. R. Random sampling in cut, flow, and network design problems. Math. Oper. Res. (1999) 24:383–413Link, Google Scholar
• Kim D., Barnhart C., Ware K., Reinhardt G. Multimodal express package delivery: A service network design application. Transportation Sci. (1999) 33:391–407Link, Google Scholar
• Kuby M., Gray R. The hub network design problem with stopovers and feeders: The case of Federal Express. Transportation Res. A: Policy and Practice (1993) 27A:1–12Crossref, Google Scholar
• Magnanti T. L., Mir chandani P. Shortest paths, single origindestination network design and associated polyhedra. Networks (1993) 23:103–121Crossref, Google Scholar
• Magnanti T. L., Wong R. T. Network design and transporation planning: Models and algorithms. Transportation Sci. (1984) 18–55Google Scholar
• Magnanti T. L., Mirchandani P., Vachani R. The convex hull of two core capacitated network design problems. Math. Programming (1993) 26:233–250Crossref, Google Scholar
• Magnanti T. L., Mirchandani P., Vachani R. Modeling and solving the two-facility capacitated network loading problem. Oper. Res. (1995) 43:142–157Link, Google Scholar
• Minoux M. Network synthesis and optimum network design problems: Models, solution methods and applications. Networks (1989) 19:313–360Crossref, Google Scholar
• Padberg M. W., Van Roy T. J., Wolsey L. A. Valid linear inequalities for fixed charge problems. Oper. Res. (1985) 33:842–861Link, Google Scholar
• Pochet Y., Wolsey L. A. Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization, and separation. Discrete Appl. Math. (1995) 59:57–74Crossref, Google Scholar
• Stallaert J. Valid inequalities and separation for capacitated fixed charge flow problems. Discrete Appl. Math. (2000) 98:265–274Crossref, Google Scholar
• Standard and Poor's Commercial transportation industry survey. (2000) FebruaryGoogle Scholar
• Van Roy T. J., Wolsey L. A. Valid inequalities and separation for uncapacitated fixed charge networks. Oper. Res. Letters (1985) 4:105–112Crossref, Google Scholar
• Williamson D. P., Goemans M. X., Mihail M., Vazirani V. V. A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica (1995) 15:435–454Crossref, Google Scholar
• Wolsey L. A. Faces of linear inequalities in 0–1 variables. Math. Programming (1975) 8:165–178Crossref, Google Scholar