Shipment Routing Algorithms with Tree Constraints
DOI10.1287/TRSC.26.3.230zbMATH Open0768.90019OpenAlexW2132641013MaRDI QIDQ4021786FDOQ4021786
Authors: Warren Powell, Ioannis A. Koskosidis 
Publication date: 17 January 1993
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.26.3.230
Recommendations
- An Algorithmic Framework for Routeing LTL Shipments
- Routing models and solution procedures for regional less-than-truckload operations
- Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics
- Dynamic routing for priority shipments in LTL service networks
- scientific article; zbMATH DE number 3952495
Deterministic network models in operations research (90B10) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Transportation, logistics and supply chain management (90B06)
Cited In (9)
- Routing models and solution procedures for regional less-than-truckload operations
- An Algorithmic Framework for Routeing LTL Shipments
- An algorithm for optimal shipments with given frequencies
- Service network design in freight transportation
- A heuristic algorithm for the truckload and less-than-truckload problem
- Minimax flow tree problems
- Dynamic routing for priority shipments in LTL service networks
- Large-scale, less-than-truckload service network design
- Multi-routing for transport-matching in cooperative, full truckload, relay networks
This page was built for publication: Shipment Routing Algorithms with Tree Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021786)
