On the quality of discrete representations in multiple objective programming
From MaRDI portal
Recommendations
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Solving multiobjective programming problems by discrete representation
- Discrete representation of non-dominated sets in multi-objective linear programming
- Disjunctive Programming for Multiobjective Discrete Optimisation
- scientific article; zbMATH DE number 4209914
- Bilevel programming for generating discrete representations in multiobjective optimization
- scientific article; zbMATH DE number 4089321
- Re. ``Discrete representation of non-dominated sets in multi-objective linear programming
- On parametric representations of the efficient set of multiple objective mathematical programming problems
Cites work
- scientific article; zbMATH DE number 3934760 (Why is no real title available?)
- scientific article; zbMATH DE number 1975095 (Why is no real title available?)
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- A comparison of two reference point methods in multiple objective mathematical programming.
- A constraint method in nonlinear multi-objective optimization
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
- Algorithm robust for the bicriteria discrete optimization problem
- An Adaptive Scalarization Method in Multiobjective Optimization
- An efficient sampling approach to multiobjective optimization
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Approximation methods in multiobjective programming
- Diversity Maximization Approach for Multiobjective Optimization
- Finding representative systems for discrete bicriterion optimization problems
- Gap-free computation of Pareto-points by quadratic scalarizations
- Generating a representative subset of the nondominated frontier in multiple criteria decision making
- Generating well-distributed sets of Pareto points for engineering design using physical programming
- Interactive decision maps. Approximation and visualization of Pareto frontier
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- On a constructive approximation of the efficient outcomes in bicriterion vector optimization
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Scalarizing vector optimization problems
- Search for efficient solutions of multi-criteria problems by target-level method
- Solving multiobjective programming problems by discrete representation
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
- The normalized normal constraint method for generating the Pareto frontier
- Three new metrics to measure the convergence of metaheuristics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization
- Towards finding global representations of the efficient set in multiple objective mathematical programming
Cited in
(26)- Representing the nondominated set in multi-objective mixed-integer programs
- Solving multiobjective programming problems by discrete representation
- scientific article; zbMATH DE number 1975095 (Why is no real title available?)
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
- Generating a representative subset of the nondominated frontier in multiple criteria decision making
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Finding representative systems for discrete bicriterion optimization problems
- Performance indicators in multiobjective optimization
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes
- Applications of discrepancy theory in multiobjective approximation
- Discrete representation of non-dominated sets in multi-objective linear programming
- Generating equidistant representations in biobjective programming
- Bilevel programming for generating discrete representations in multiobjective optimization
- An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
- Considering dynamic Pareto frontiers in decision making
- A robust reverse pharmaceutical supply chain design considering perishability and sustainable development objectives
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- An introduction to multiobjective simulation optimization
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- Computing representations using hypervolume scalarizations
- Covers and approximations in multiobjective optimization
- On finding representative non-dominated points for bi-objective integer network flow problems
- Distribution based representative sets for multi-objective integer programs
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- Representation of the non-dominated set in biobjective discrete optimization
This page was built for publication: On the quality of discrete representations in multiple objective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q374696)
