Fast approximation algorithms for routing problems with hop-wise constraints

DOI10.1007/s10479-013-1308-5zbMath1303.90089OpenAlexW2002806127MaRDI QIDQ490222

Amir Elalouf

Publication date: 22 January 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1308-5

zbMATH Keywords

shortest pathcombinatorial problemsapproximation algorithmsrouting

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduler -- a system for staff planning
• A survey on multi-constrained optimal path computation: exact and approximate algorithms
• A branch and bound method for the job-shop problem with sequence-dependent setup times
• The shortest path problem with two objective functions
• Fast approximation algorithm for job sequencing with deadlines
• An improved FPTAS for Restricted Shortest Path.
• A survey of recent developments in multiobjective optimization
• A dual algorithm for the constrained shortest path problem
• Approximation Schemes for the Restricted Shortest Path Problem
• A simple efficient approximation scheme for the restricted shortest path problem

This page was built for publication: Fast approximation algorithms for routing problems with hop-wise constraints