Reducing Truckload Transportation Costs Through Collaboration

References

• Alon N., Tarsi M. Covering multigraphs by simple circuits. SIAM J. Algorithmic Discrete Methods (1985) 6:345–350Crossref, Google Scholar
• Bentley J. L. K-d trees for semidynamic point sets. Proc. 6th Annual ACM Sympos. Comput. Geometry (1990) 187–197Crossref, Google Scholar
• Bermond J. C., Jackson B., Jaeger F. Shortest covering of graphs with cycles. J. Combin. Theory, Ser. B (1983) 35:297–308Crossref, Google Scholar
• Caplice C., Sheffi Y. Optimization-based procurement for transportation services. J. Bus. Logist. (2003) 24:109–128Crossref, Google Scholar
• Ergun O., Kuyzu G., Savelsbergh M. The shipper collaboration problem. Comput. Oper. Res. (2003) . ForthcomingGoogle Scholar
• Fan G. Covering graphs by cycles. SIAM J. Discrete Math. (1992) 5:491–496Crossref, Google Scholar
• Fraisse P. Cycle covering in bridgeless graphs. J. Combin. Theory, Ser. B (1985) 39:146–152Crossref, Google Scholar
• Guan M., Fleischner H. On the minimum weighted cycle covering problem for planar graphs. Ars Combinatoria (1985) 20:61–68Google Scholar
• Hochbaum D. S., Olinick E. V. The bounded cycle cover problem. INFORMS J. Comput. (2001) 13:104–119Link, Google Scholar
• Itai A., Lipton R. J., Papadimitriou C. H., Rodeh M. Covering graphs by simple circuits. SIAM J. Comput. (1981) 10:746–750Crossref, Google Scholar
• Jackson B. Shortest circuit covers and postman tours in graphs with a nowhere zero 4-flows. SIAM J. Comput. (1990) 19:659–665Crossref, Google Scholar
• Kesel’man D. Y. Covering the edges of a graph by circuits. Kibernetica (1987) 3:16–22Google Scholar
• Labbe M., Laporte G., Soriano P. Covering a graph with cycles. Comput. Oper. Res. (1998) 25:499–504Crossref, Google Scholar
• Lynch K. Collaborative logistics networks—Breaking traditional performance barriers for shippers and carriers. (2001) . White paper, Nistevo. http://www.nistevo.com/v1/downloads/index.htmlGoogle Scholar
• Moore E. W., Warmke J. M., Gorban L. R. The indispensable role of mangement science in centralizing freight operations at Reynolds Metal Company. Interfaces (1991) 21:107–129Link, Google Scholar
• Powell W. B., Marar A., Gelfand J., Bowers S. Implementing real-time optimization models: A case application from the motor carrier industry. Oper. Res. (2002) 50:571–581Link, Google Scholar
• Powell W. B., Sheffi Y., Nickerson K., Butterbaugh K., Atherton S. Maximizing profits for North American Van Lines’ truckload division: A new framework for pricing and operations. Interfaces (1988) 18:21–41Link, Google Scholar
• Song J., Regan A. Combinatorial auctions for transportation service procurement: The carrier perspective. Transportation Res. Record (2002) 1833:40–46Crossref, Google Scholar
• Thomassen C. On the complexity of finding a minimum cycle cover of a graph. SIAM J. Comput. (1997) 26:675–677Crossref, Google Scholar
• Yang J., Jaillet P., Mahmassani H. S. On-line algorithms for truck fleet assignment and scheduling under real-time information. Transportation Res. Record (1999) 1667:107–113Crossref, Google Scholar