Reference points and approximation algorithms in multicriteria discrete optimization

DOI10.1016/j.ejor.2016.05.027zbMath1403.90596arXiv1207.3165OpenAlexW2405814934MaRDI QIDQ1753504

Sebastian Stiller, Kai-Simon Goetzmann, Christina Büsing, Jannik Matuschke

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.3165

zbMATH Keywords

combinatorial optimizationapproximation algorithmscompromise programmingmulticriteria optimizationreference point methods

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)

Related Items (4)

Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components ⋮ Extensions of dynamic programming for multi-stage combinatorial optimization ⋮ Bi-objective short-term scheduling in a rolling horizon framework: a priori approaches with alternative operational objectives ⋮ Dynamic programming bi-criteria combinatorial optimization

Cites Work

• Compromise programming: non-interactive calibration of utility-based metrics
• An FPTAS for optimizing a class of low-rank functions over a polytope
• Axiomatizations of the Euclidean compromise solution
• Approximation of min-max and min-max regret versions of some combinatorial optimization problems
• \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
• Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions
• A visual interactive method for solving the multiple criteria problem
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• Compromise solutions and estimation of the noninferior set
• The ellipsoid method and its consequences in combinatorial optimization
• Nonlinear multiobjective optimization
• Compromise solution by MCDM methods: A comparative analysis of VIKOR and TOPSIS.
• The ``Light Beam Search approach. -- An overview of methodology and applications
• Multicriteria decision making: advances in MCDM models, algorithms, theory, and applications
• Decision-making based on approximate and smoothed Pareto curves
• Efficiently computing succinct trade-off curves
• The Design of Approximation Algorithms
• Approximation in stochastic scheduling
• Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
• Approximating Min-Max (Regret) Versions of Some Polynomial Problems
• Iterative Rounding for Multi-Objective Optimization Problems
• A mathematical basis for satisficing decision making
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Interactive Compromise Programming
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Some New Results on Compromise Solutions for Group Decision Problems
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• A naïve approach for solving MCDM problems: the GUESS method
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• An interactive weighted Tchebycheff procedure for multiple objective programming
• A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
• A Class of Solutions for Group Decision Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reference points and approximation algorithms in multicriteria discrete optimization