The lane covering problem with time windows

DOI10.1080/09720529.2008.10698167zbMath1201.90053OpenAlexW2320067374MaRDI QIDQ3512195

Gianpaolo Ghiani, Emanuele Manni, Chefi Triki

Publication date: 11 July 2008

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2008.10698167

zbMATH Keywords

Lagrangian relaxationtransportationcollaborative logisticslane covering

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Related Items (4)

Location-based techniques for the synergy approximation in combinatorial transportation auctions ⋮ A two‐stage method for the shipper lane selection problem with time windows in transportation service procurement ⋮ Collaborative vehicle routing: a survey ⋮ The stochastic bid generation problem in combinatorial transportation auctions

Cites Work

• A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
• Implementing Real-Time Optimization Models: A Case Application From The Motor Carrier Industry

This page was built for publication: The lane covering problem with time windows