Lane covering with partner bounds in collaborative truckload transportation procurement
From MaRDI portal
Publication:1652017
DOI10.1016/j.cor.2016.07.018zbMath1391.90069OpenAlexW2486102764MaRDI QIDQ1652017
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
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
The joint network vehicle routing game with optional customers ⋮ Combining facility location and routing decisions in sustainable urban freight distribution under horizontal collaboration: how can shippers be benefited? ⋮ Collaborative vehicle routing: a survey ⋮ Exact solutions for the collaborative pickup and delivery problem
Cites Work
- Shipper collaboration
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
- Stabilized column generation
- Variable neighborhood search
- On characterization of the core of lane covering games via dual solutions
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- The Bounded Cycle-Cover Problem
- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
- On the Complexity of Finding a Minimum Cycle Cover of a Graph
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
- An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand
- Selected Topics in Column Generation
- STACS 2005
This page was built for publication: Lane covering with partner bounds in collaborative truckload transportation procurement
