Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
From MaRDI portal
Publication:2297563
DOI10.1016/J.COR.2019.104872zbMATH Open1458.90576OpenAlexW2998261377WikidataQ126418147 ScholiaQ126418147MaRDI QIDQ2297563FDOQ2297563
Authors: Yanyan Li 
Publication date: 20 February 2020
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.104872
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
- Multiple criteria decision analysis. State of the art surveys. In 2 volumes
- Diversity Maximization Approach for Multiobjective Optimization
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- A discussion of scalarization techniques for multiple objective integer programming
- Finding representative systems for discrete bicriterion optimization problems
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- Bicriteria Transportation Problem
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Title not available (Why is that?)
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
- On finding representative non-dominated points for bi-objective integer network flow problems
- Representation of the non-dominated set in biobjective discrete optimization
- Generating a representative subset of the nondominated frontier in multiple criteria decision making
- On the quality of discrete representations in multiple objective programming
- Generating equidistant representations in biobjective programming
- Discrete representation of non-dominated sets in multi-objective linear programming
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes
- Branch-and-Bound for Bi-objective Integer Programming
- Clustering aided approach for decision making in computationally expensive multiobjective optimization
Cited In (7)
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- Performance indicators in multiobjective optimization
- Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm
- 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)
