Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
From MaRDI portal
(Redirected from Publication:2297563)
Recommendations
- On the quality of discrete representations in multiple objective programming
- Representation of the non-dominated set in biobjective discrete optimization
- Generating equidistant representations in biobjective programming
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
Cites work
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
- A discussion of scalarization techniques for multiple objective integer programming
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Bicriteria Transportation Problem
- Branch-and-bound for bi-objective integer programming
- Clustering aided approach for decision making in computationally expensive multiobjective optimization
- Discrete representation of non-dominated sets in multi-objective linear programming
- Diversity Maximization Approach for Multiobjective Optimization
- Finding representative systems for discrete bicriterion optimization problems
- Generating a representative subset of the nondominated frontier in multiple criteria decision making
- Generating equidistant representations in biobjective programming
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Multiple criteria decision analysis. State of the art surveys. In 2 volumes
- On finding representative non-dominated points for bi-objective integer network flow problems
- On the quality of discrete representations in multiple objective programming
- Representation of the non-dominated set in biobjective discrete optimization
Cited in
(13)- New -constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- Strategic flood impact mitigation in developing countries' urban road networks: application to Hanoi
- Discrete representation of non-dominated sets in multi-objective linear programming
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- Three multi-objective memetic algorithms for observation scheduling problem of active-imaging agile earth observation satellites
- Performance indicators in multiobjective optimization
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm
- Representation of the non-dominated set in biobjective discrete optimization
- Generating equidistant representations in biobjective programming
- Computing representations using hypervolume scalarizations
- Finding representative systems for discrete bicriterion optimization problems
- Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
This page was built for publication: Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297563)
