On the quality of discrete representations in multiple objective programming
From MaRDI portal
Publication:374696
DOI10.1007/s11081-009-9099-xzbMath1273.90184OpenAlexW1979571476MaRDI QIDQ374696
Margaret M. Wiecek, Stacey L. Faulkenberg
Publication date: 24 October 2013
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-009-9099-x
efficient setPareto setquality measuresnondominated setdiscrete representationsmultiple objective programs
Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10)
Related Items
Considering dynamic Pareto frontiers in decision making, An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems, Bilevel programming for generating discrete representations in multiobjective optimization, On finding representative non-dominated points for bi-objective integer network flow problems, Representation of the non-dominated set in biobjective discrete optimization, Approximation Methods for Multiobjective Optimization Problems: A Survey, Distribution based representative sets for multi-objective integer programs, Computing representations using hypervolume scalarizations, An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization, Generating equidistant representations in biobjective programming, Representing the nondominated set in multi-objective mixed-integer programs, Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes, Covers and approximations in multiobjective optimization, Discrete representation of non-dominated sets in multi-objective linear programming, Discrete representation of the non-dominated set for multi-objective optimization problems using kernels, Performance indicators in multiobjective optimization, Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization, New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The normalized normal constraint method for generating the Pareto frontier
- Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
- Three new metrics to measure the convergence of metaheuristics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- On a constructive approximation of the efficient outcomes in bicriterion vector optimization
- Search for efficient solutions of multi-criteria problems by target-level method
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- A comparison of two reference point methods in multiple objective mathematical programming.
- Scalarizing vector optimization problems
- Generating well-distributed sets of Pareto points for engineering design using physical programming
- Gap-free computation of Pareto-points by quadratic scalarizations
- Interactive decision maps. Approximation and visualization of Pareto frontier
- Algorithm robust for the bicriteria discrete optimization problem
- An efficient sampling approach to multiobjective optimization
- Finding representative systems for discrete bicriterion optimization problems
- Approximation methods in multiobjective programming
- The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
- Diversity Maximization Approach for Multiobjective Optimization
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- An Adaptive Scalarization Method in Multiobjective Optimization
- A Constraint Method in Nonlinear Multi-Objective Optimization
- Solving multiobjective programming problems by discrete representation
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making
