Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications

DOI10.1007/s00224-007-9096-4zbMath1175.90366OpenAlexW2060882019MaRDI QIDQ841630

George Tsaggouris, Christos D. 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

zbMATH Keywords

multiobjective optimizationFPTASmultiobjective shortest pathmultiple constrained (optimal) pathnon-additive shortest pathnonlinear objectivesQos-aware multicommodity flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29)

Related Items

Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications, Generic constraints handling techniques in constrained multi-criteria optimization and its application, Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms, Analysis of FPTASes for the multi-objective shortest path problem, Simple paths with exact and forbidden lengths, PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries, A general approximation method for bicriteria minimization problems, Min‐Max quickest path problems, Approximation Methods for Multiobjective Optimization Problems: A Survey, Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem, Simple and efficient bi-objective search algorithms via fast dominance checks, Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem, Covers and approximations in multiobjective optimization, Bi-criteria path problem with minimum length and maximum survival probability, No truthful mechanism can be better than \(n\) approximate for two natural problems, One-exact approximate Pareto sets, On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths

Cites Work

• Shortest paths in networks with vector weights
• Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Multicriteria optimization
• An improved FPTAS for Restricted Shortest Path.
• Multiple criteria decision analysis. State of the art surveys
• Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
• QoS-aware Multicommodity Flows and Transportation Planning ?
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• The general multimodal network equilibrium problem with elastic demand
• Approximation Schemes for the Restricted Shortest Path Problem
• The Traffic Equilibrium Problem with Nonadditive Path Costs
• Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
• Automata, Languages and Programming
• Algorithms and Computation
• A simple efficient approximation scheme for the restricted shortest path problem