Pages that link to "Item:Q3635203"
From MaRDI portal
The following pages link to A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors (Q3635203):
Displaying 26 items.
- Bi-objective robust optimisation (Q322907) (← links)
- Approximate representation of the Pareto frontier in multiparty negotiations: decentralized methods and privacy preservation (Q323444) (← links)
- On the quality of discrete representations in multiple objective programming (Q374696) (← links)
- Generating equidistant representations in biobjective programming (Q429518) (← links)
- Exploring the trade-off between generalization and empirical errors in a one-norm SVM (Q439563) (← links)
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117) (← 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)
- Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← links)
- An a posteriori decision support methodology for solving the multi-criteria supplier selection problem (Q1991156) (← links)
- Fair resource allocation: using welfare-based dominance constraints (Q2242256) (← 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)
- Approximation methods in multiobjective programming (Q2583199) (← 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)
- (Q2933454) (← links)
- Towards finding global representations of the efficient set in multiple objective mathematical programming (Q4346866) (← links)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
- A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach (Q6071088) (← links)
- Generating representative sets for multiobjective discrete optimization problems with specified coverage errors (Q6667690) (← links)
