Pages that link to "Item:Q342058"
From MaRDI portal
The following pages link to Representation of the non-dominated set in biobjective discrete optimization (Q342058):
Displaying 22 items.
- On the representation of the search region in multi-objective optimization (Q319674) (← links)
- Biobjective robust optimization over the efficient set for Pareto set reduction (Q322934) (← links)
- On finding representative non-dominated points for bi-objective integer network flow problems (Q337035) (← links)
- Generating equidistant representations in biobjective programming (Q429518) (← links)
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming (Q1575074) (← links)
- Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
- Finding representations for an unconstrained bi-objective combinatorial optimization problem (Q1744630) (← links)
- Discrete representation of non-dominated sets in multi-objective linear programming (Q1751259) (← links)
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
- Implicit enumeration strategies for the hypervolume subset selection problem (Q1782182) (← links)
- Approximating the noninferior set in linear biobjective programs using multiparametric decomposition (Q1823867) (← links)
- A model of anytime algorithm performance for bi-objective optimization (Q2022237) (← links)
- Decision space robustness for multi-objective integer linear programming (Q2108813) (← links)
- Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
- Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← links)
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization (Q2297563) (← links)
- Finding representative systems for discrete bicriterion optimization problems (Q2467474) (← links)
- Computing representations using hypervolume scalarizations (Q2669609) (← links)
- A method for generating a well-distributed Pareto set in multiple objective mixed integer linear programs based on the decision maker's initial aspiration level (Q2821098) (← links)
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors (Q3635203) (← links)
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
- Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making (Q5188993) (← links)
