Approximation with a fixed number of solutions of some biobjective maximization problems

DOI10.1007/978-3-642-29116-6_20MaRDI QIDQ2896393zbMATH OpenOpenAlexFDO

Authors Laurent Gourvès, Jérôme Monnot, Cristina Bazgan

Publication date 16 July 2012

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29116-6_20

Mathematics Subject Classification ID

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

Recommendations

• Approximation with a fixed number of solutions of some multiobjective maximization problems
• Small approximate Pareto sets for biobjective shortest paths and other problems
• Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
• Approximate Pareto sets of minimal size for multi-objective optimization problems
• One-exact approximate Pareto sets

Cited in

(7)

• Approximation with a fixed number of solutions of some multiobjective maximization problems
• Approximate Pareto sets of minimal size for multi-objective optimization problems
• A scheme of approximation solution of problem 1 |r j|L max
• Numerical certification of Pareto optimality for biobjective nonlinear problems
• Small approximate Pareto sets for biobjective shortest paths and other problems
• Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
• Approximating biobjective minimization problems using general ordering cones

This page was built for publication: Approximation with a fixed number of solutions of some biobjective maximization problems

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