Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
DOI10.1007/S00224-007-9096-4zbMATH Open1175.90366OpenAlexW2060882019MaRDI QIDQ841630FDOQ841630
Authors: George Tsaggouris, Christos Zaroliagis 
Publication date: 18 September 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9096-4
Recommendations
- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
- Analysis of FPTASes for the multi-objective shortest path problem
- A multi-objective shortest path problem
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Multiobjective routing problems
FPTASmultiobjective optimizationmultiobjective shortest pathmultiple constrained (optimal) pathnon-additive shortest pathnonlinear objectivesQos-aware multicommodity flow
Cites Work
- Multiple criteria decision analysis. State of the art surveys
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Multicriteria optimization
- An improved FPTAS for Restricted Shortest Path.
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation Schemes for the Restricted Shortest Path Problem
- A simple efficient approximation scheme for the restricted shortest path problem
- The general multimodal network equilibrium problem with elastic demand
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
- The Traffic Equilibrium Problem with Nonadditive Path Costs
- Shortest paths in networks with vector weights
- Algorithms and Computation
- Approximating fractional multicommodity flow independent of the number of commodities
- QoS-aware multicommodity flows and transportation planning
- Automata, Languages and Programming
Cited In (20)
- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
- Multi-objective and multi-constrained non-additive shortest path problems
- Simple paths with exact and forbidden lengths
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem
- Generic constraints handling techniques in constrained multi-criteria optimization and its application
- One-exact approximate Pareto sets
- Analysis of FPTASes for the multi-objective shortest path problem
- PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
- No truthful mechanism can be better than \(n\) approximate for two natural problems
- QoS-aware multicommodity flows and transportation planning
- MIN-MAX quickest path problems
- Simple and efficient bi-objective search algorithms via fast dominance checks
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths
- A general approximation method for bicriteria minimization problems
- Covers and approximations in multiobjective optimization
- Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
- Bi-criteria path problem with minimum length and maximum survival probability
This page was built for publication: Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841630)
