Pages that link to "Item:Q3392180"
From MaRDI portal
The following pages link to Diversity Maximization Approach for Multiobjective Optimization (Q3392180):
Displaying 26 items.
- Optimal path problems with second-order stochastic dominance constraints (Q264233) (← 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)
- Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
- A hybrid approach for biobjective optimization (Q1662163) (← links)
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
- Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← links)
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
- A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing (Q2140160) (← links)
- The interplay between transitivity and completeness: generalized \textsf{NaP}-preferences (Q2154163) (← links)
- Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
- Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← links)
- An approximation scheme for the bi-scenario sum of completion times trade-off problem (Q2283294) (← links)
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization (Q2297563) (← links)
- An extension of the non-inferior set estimation algorithm for many objectives (Q2301933) (← links)
- On the multi-utility representation of preference relations (Q2427856) (← links)
- Split algorithms for multiobjective integer programming problems (Q2669784) (← links)
- Characteristics of semi-convex frontier optimization (Q2790869) (← links)
- Modeling and analysis of multiobjective lot splitting for <i>N</i> -product <i>M</i> -machine flowshop lines (Q3560225) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Branch-and-Bound for Bi-objective Integer Programming (Q5139633) (← 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)
- Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)
- Density function-based trust region algorithm for approximating Pareto front of black-box multiobjective optimization problems (Q6190800) (← links)
