Lane covering with partner bounds in collaborative truckload transportation procurement
DOI10.1016/J.COR.2016.07.018zbMATH Open1391.90069OpenAlexW2486102764MaRDI QIDQ1652017FDOQ1652017
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.018
Recommendations
- Shipper collaboration
- The lane covering problem with time windows
- Shipper collaboration in forward and reverse logistics
- Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
- Collaborative transportation with overlapping coalitions
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38) Transportation, logistics and supply chain management (90B06)
Cites Work
- Selected Topics in Column Generation
- Stabilized column generation
- Branch-and-price: Column generation for solving huge integer programs
- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
- STACS 2005
- Variable neighborhood search
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
- An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand
- Shipper collaboration
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
- On the Complexity of Finding a Minimum Cycle Cover of a Graph
- On characterization of the core of lane covering games via dual solutions
- The bounded cycle-cover problem
Cited In (7)
- Combining facility location and routing decisions in sustainable urban freight distribution under horizontal collaboration: how can shippers be benefited?
- Contract and mode choices under demand and price volatility in a shipping supply chain
- Collaborative vehicle routing: a survey
- Exact solutions for the collaborative pickup and delivery problem
- The joint network vehicle routing game with optional customers
- Shipper collaboration
- The lane covering problem with time windows
This page was built for publication: Lane covering with partner bounds in collaborative truckload transportation procurement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652017)
