Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications

DOI10.1007/11940128_40zbMath1135.90403OpenAlexW1480013811MaRDI QIDQ5459134

George Tsaggouris, Christos D. Zaroliagis

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_40

Mathematics Subject Classification ID

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

Related Items (8)

Time dependent multiobjective best path for multimodal urban routing ⋮ Decision-making based on approximate and smoothed Pareto curves ⋮ Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications ⋮ Multi-objective and multi-constrained non-additive shortest path problems ⋮ An improved multiobjective shortest path algorithm ⋮ Approximation with a fixed number of solutions of some multiobjective maximization problems ⋮ Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem ⋮ Approximate Pareto sets of minimal size for multi-objective optimization problems

This page was built for publication: Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications