Diversity Maximization Approach for Multiobjective Optimization
From MaRDI portal
Publication:3392180
DOI10.1287/opre.1070.0413zbMath1167.90644OpenAlexW2057882206MaRDI QIDQ3392180
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1070.0413
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (26)
Optimal path problems with second-order stochastic dominance constraints ⋮ A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing ⋮ Approximate representation of the Pareto frontier in multiparty negotiations: decentralized methods and privacy preservation ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ The interplay between transitivity and completeness: generalized \textsf{NaP}-preferences ⋮ A hybrid approach for biobjective optimization ⋮ Network Models for Multiobjective Discrete Optimization ⋮ On the quality of discrete representations in multiple objective programming ⋮ Distribution based representative sets for multi-objective integer programs ⋮ Split algorithms for multiobjective integer programming problems ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ On the multi-utility representation of preference relations ⋮ Density function-based trust region algorithm for approximating Pareto front of black-box multiobjective optimization problems ⋮ Generating equidistant representations in biobjective programming ⋮ Branch-and-Bound for Bi-objective Integer Programming ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ Modeling and analysis of multiobjective lot splitting for N -product M -machine flowshop lines ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ Characteristics of semi-convex frontier optimization ⋮ An approximation scheme for the bi-scenario sum of completion times trade-off problem ⋮ Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization ⋮ An extension of the non-inferior set estimation algorithm for many objectives ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
Uses Software
This page was built for publication: Diversity Maximization Approach for Multiobjective Optimization
