Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
From MaRDI portal
Publication:2297563
DOI10.1016/j.cor.2019.104872zbMath1458.90576OpenAlexW2998261377WikidataQ126418147 ScholiaQ126418147MaRDI QIDQ2297563
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
Related Items (4)
Computing representations using hypervolume scalarizations ⋮ Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm ⋮ Performance indicators in multiobjective optimization ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
Cites Work
- Unnamed Item
- 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
- Representation of the non-dominated set in biobjective discrete optimization
- On the quality of discrete representations in multiple objective programming
- Generating equidistant representations in biobjective 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
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Discrete representation of non-dominated sets in multi-objective linear 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 Mixed Integer Programming: The Triangle Splitting Method
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
- Diversity Maximization Approach for Multiobjective Optimization
- Clustering aided approach for decision making in computationally expensive multiobjective optimization
- Bicriteria Transportation Problem
- Branch-and-Bound for Bi-objective Integer Programming
- Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making
This page was built for publication: Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
