Fast approximation algorithms for routing problems with hop-wise constraints

DOI10.1007/S10479-013-1308-5MaRDI QIDQ490222zbMATHOpenAlexFDO

Authors 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

approximation algorithmsshortest pathroutingcombinatorial problems

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)

Recommendations

• Fast algorithms for mobile agent routing with node-wise constraints in communications networks
• Algorithms and Computation
• An improved FPTAS for Restricted Shortest Path.
• Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints
• Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints

Cites work

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

Cited in

(9)

• An improved FPTAS for Restricted Shortest Path.
• On the directed hop-constrained shortest path problem
• Direct \(k\)-routing versus cross-docking: worst-case results
• Fast algorithms for mobile agent routing with node-wise constraints in communications networks
• Algorithms for the Multi-constrained Routing Problem
• Constraint satisfaction, packet routing, and the lovasz local lemma
• scientific article; zbMATH DE number 6538149 (Why is no real title available?)
• scientific article; zbMATH DE number 3902389 (Why is no real title available?)
• An improved FPTAS for mobile agent routing with time constraints

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

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