Hausdorff methods for approximating the convex Edgeworth-Pareto hull in integer problems with monotone objectives

DOI10.1134/S0965542516080133zbMath1393.90111OpenAlexW2517699648MaRDI QIDQ519662

A. I. Pospelov

Publication date: 5 April 2017

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542516080133

zbMATH Keywords

adaptive methodsmultiobjective optimizationconvergence ratepolyhedral approximationPareto frontierinteger optimization

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Investigation of a linear convolution of criteria in multicriterial discrete programming
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Algorithms for solving the two-criterion large-scale travelling salesman problem
• Interactive decision maps. Approximation and visualization of Pareto frontier
• Finding representative systems for discrete bicriterion optimization problems
• Bicriterial problem of decomposition of a production system
• Polyhedral approximation of convex compact bodies by filling methods
• Approximating the convex Edgeworth-Pareto hull in integer multi-objective problems with monotone criteria
• Convex and Discrete Geometry
• Study of the linear parametrization of criteria in the bicriteria knapsack problem

This page was built for publication: Hausdorff methods for approximating the convex Edgeworth-Pareto hull in integer problems with monotone objectives