What are the worst cases in constrained last-in-first-out pick-up and delivery problems?

DOI10.1016/j.ejor.2018.04.005zbMath1403.90178OpenAlexW2797197186WikidataQ129989607 ScholiaQ129989607MaRDI QIDQ1651694

Dominique de Werra, Sebastián Urrutia

Publication date: 12 July 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.005

zbMATH Keywords

combinatorial optimizationbounded chromatic numberpermutation graphspick-up and delivery

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Exact algorithms for the double vehicle routing problem with multiple stacks
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
• Bounded vertex colorings of graphs
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• The precedence-constrained asymmetric traveling salesman polytope
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
• A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading

This page was built for publication: What are the worst cases in constrained last-in-first-out pick-up and delivery problems?