Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
From MaRDI portal
Publication:6667690
DOI10.1007/S10589-024-00627-YMaRDI QIDQ6667690
Publication date: 20 January 2025
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finding representative non-dominated points for bi-objective integer network flow problems
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- On the characterization of noninferior solutions of the vector optimization problem
- Algorithms for nonlinear integer bicriterion problems
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Bilevel programming for generating discrete representations 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
- Finding a representative nondominated set for multi-objective mixed integer programs
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- Finding representative systems for discrete bicriterion optimization problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- 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
- Solving multiobjective programming problems by discrete representation
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- Network Models for Multiobjective Discrete Optimization
- Disjunctive Programming for Multiobjective Discrete Optimisation
- Effective anytime algorithm for multiobjective combinatorial optimization problems
- A simple, efficient and versatile objective space algorithm for multiobjective integer programming
This page was built for publication: Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6667690)
