An integral LP relaxation for a drayage problem

DOI10.1016/j.disopt.2018.09.002zbMath1506.90034OpenAlexW2898973634WikidataQ129023362 ScholiaQ129023362MaRDI QIDQ2419362

Claudio Gentile, Giuseppe Stecca, Massimo Di Francesco, Paola Zuddas, Stefan Schirra

Publication date: 13 June 2019

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11584/254925

zbMATH Keywords

vehicle routing problemlogisticstotal unimodularitydrayage

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (1)

A multiperiod drayage problem with customer-dependent service periods

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristic-based truck scheduling for inland container transportation
• A local search heuristic for the pre- and end-haulage of intermodal container terminals
• Totally balanced and totally unimodular matrices defined by center location problems
• Two simple applications of the unmodularity property
• Vehicle routing with split deliveries
• Integrated planning of loaded and empty container movements
• A truck scheduling problem arising in intermodal container transportation
• A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
• Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem
• Optimization of the drayage problem using exact methods

This page was built for publication: An integral LP relaxation for a drayage problem