Fast approximation algorithms for routing problems with hop-wise constraints
DOI10.1007/S10479-013-1308-5zbMATH Open1303.90089OpenAlexW2002806127MaRDI QIDQ490222FDOQ490222
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
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
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
- Introduction to algorithms
- An improved FPTAS for Restricted Shortest Path.
- Approximation Schemes for the Restricted Shortest Path Problem
- A simple efficient approximation scheme for the restricted shortest path problem
- Fast approximation algorithm for job sequencing with deadlines
- A survey of recent developments in multiobjective optimization
- A survey on multi-constrained optimal path computation: exact and approximate algorithms
- Scheduler -- a system for staff planning
- The shortest path problem with two objective functions
- A dual algorithm for the constrained shortest path problem
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- An improved FPTAS for mobile agent routing with time constraints
- Mobile agent routing with time constraints: a resource constrained longest-path approach
Cited In (9)
- Title not available (Why is that?)
- Algorithms for the Multi-constrained Routing Problem
- An improved FPTAS for Restricted Shortest Path.
- Direct \(k\)-routing versus cross-docking: worst-case results
- Fast algorithms for mobile agent routing with node-wise constraints in communications networks
- Constraint satisfaction, packet routing, and the lovasz local lemma
- Title not available (Why is that?)
- An improved FPTAS for mobile agent routing with time constraints
- On the directed hop-constrained shortest path problem
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)
