What are the worst cases in constrained last-in-first-out pick-up and delivery problems?
type: Item
instance of: scholarly article
title: What are the worst cases in constrained last-in-first-out pick-up and delivery problems?
zbMATH Open document ID: 1403.90178
author: Sebastián Urrutia
author: Dominique De Werra
published in: European Journal of Operational Research
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6902945
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: pick-up and delivery
zbMATH Keywords: permutation graphs
zbMATH Keywords: bounded chromatic number
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.04.005
OpenAlex ID: W2797197186
cites work: The precedence-constrained asymmetric traveling salesman polytope
cites work: Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
cites work: An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
cites work: A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
cites work: Efficient algorithms for the double traveling salesman problem with multiple stacks
cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
cites work: Bounded vertex colorings of graphs
cites work: Exact algorithms for the double vehicle routing problem with multiple stacks
cites work: Q4027169
cites work: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
cites work: A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
Wikidata QID: Q129989607
DOI: 10.1016/J.EJOR.2018.04.005
description: scientific article; zbMATH DE number 6902945