Covers and approximations in multiobjective optimization
From MaRDI portal
Publication:513168
DOI10.1007/s10898-016-0426-4zbMath1392.90102OpenAlexW2326917672MaRDI QIDQ513168
Margaret M. Wiecek, Lakmali Weerasena, Daniel Vanderpooten
Publication date: 3 March 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0426-4
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Advancing local search approximations for multiobjective combinatorial optimization problems ⋮ On upper approximations of Pareto fronts ⋮ Approximating biobjective minimization problems using general ordering cones ⋮ A tolerance function for the multiobjective set covering problem ⋮ Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the quality of discrete representations in multiple objective programming
- Topology of septics with the set of singularities \(\mathbf B_{4,4} \oplus 2\mathbf A_3 \oplus 5\mathbf A_1\) and \(\pi_1\)-equivalent weak Zariski pairs
- Constructing a Pareto front approximation for decision making
- Stochastic convergence of random search methods to fixed size Pareto front approximations
- Algebra of efficient sets for multiobjective complex systems
- PAINT: Pareto front interpolation for nonlinear multiobjective optimization
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
- Approximately dominating representatives
- Relative importance of criteria in multiobjective programming: a cone-based approach
- Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- \(\epsilon\)-solutions in vector minimization problems
- Theory of multiobjective optimization
- Epsilon efficiency
- The domination property in multicriteria optimization
- Analytic efficient solution set for multi-criteria quadratic programs
- A bi-objective uncapacitated facility location problem
- On several concepts for \(\varepsilon\)-efficiency
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time
- Optimisation of beam directions in intensity modulated radiation therapy planning
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- Response surface approximation of Pareto optimal front in multi-objective optimization
- Cone characterizations of approximate solutions in real vector optimization
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Multidisciplinary design optimization with quasiseparable subsystems
- Efficiently computing succinct trade-off curves
- Approximation methods in multiobjective programming
- Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
- Approximating Multiobjective Knapsack Problems
- On approximating multicriteria TSP
- Relational Systems of Preference with One or More Pseudo-Criteria: Some New Concepts and Results
- Approximating the Pareto Front of Multi-criteria Optimization Problems
- Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Relative importance of criteria: a quantitative approach
- Approximating nondominated sets in continuous multiobjective optimization problems
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Multiple objectives decomposition-coordination methods for hierarchical organizations
- Using interdependent information on the relative importance of criteria in decision making
This page was built for publication: Covers and approximations in multiobjective optimization
