Efficiently computing succinct trade-off curves

DOI10.1007/978-3-540-27836-8_99MaRDI QIDQ5466550zbMATH OpenOpenAlexFDO

Authors Sergei Vassilvitskii, Mihalis Yannakakis

Publication date 24 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Approximation algorithms (68W25) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Efficiently computing succinct trade-off curves
• Efficient solutions and bounds on tradeoffs
• On efficient solutions with trade-offs bounded by given values
• Efficient curve fitting: an application of multiobjective programming
• Two methods for determining properly effcient solutions with a minimum upper bound for trade-offs
• Efficient computation of optimal actions
• scientific article; zbMATH DE number 770229
• scientific article; zbMATH DE number 1225853
• Efficient calculation of sensitivities for optimization problems
• Computationally efficient approximation mechanisms

Cited in

(8)

• The multiple shortest path problem with path deconfliction
• Bi-criteria path problem with minimum length and maximum survival probability
• Efficiently computing succinct trade-off curves
• Error estimates for the crude approximation of the trade-off curve
• Approximation of multiobjective optimization problems
• 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
• Approximately dominating representatives

This page was built for publication: Efficiently computing succinct trade-off curves

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