Complexity of fixed order routing

DOI10.1007/978-3-031-81396-2_13MaRDI QIDQ6974409zbMATH OpenFDO

Authors Steven Miltenburg, Tim Oosterwijk, René A. Sitters

Publication date 6 June 2025

Full work available at URL https://research.vu.nl/en/publications/ba367f04-9b7c-4b89-93f0-5c8cd9ba9094

zbMATH Keywords

approximation algorithmscomplexityrouting

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites work

• A PTAS for Capacitated Vehicle Routing on Trees
• Almost Tight Bounds for Reordering Buffer Management
• Bounds and Heuristics for Capacitated Routing Problems
• Capacitated vehicle routing in graphic metrics
• Fixed-order scheduling on parallel machines
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• scientific article; zbMATH DE number 432776 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2102754 (Why is no real title available?)
• Improving the approximation ratio for capacitated vehicle routing
• Maximum bounded \(H\)-matching is Max SNP-complete
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• New Ressults on Server Problems
• Scheduling games with machine-dependent priority lists
• Sometimes Travelling is Easy: The Master Tour Problem
• The \(k\)-server problem
• The complexity of the travelling repairman problem
• The Traveling Salesman Problem with Distances One and Two
• Vehicle Routing

This page was built for publication: Complexity of fixed order routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974409)