Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
From MaRDI portal
Publication:1575074
DOI10.1007/s101070050128zbMath0970.90090OpenAlexW4233783227MaRDI QIDQ1575074
Publication date: 9 November 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050128
Related Items (52)
The controlled estimation method in the multiobjective linear fractional problem ⋮ The \(L\)-shape search method for triobjective integer programming ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ Solution approaches for equitable multiobjective integer programming problems ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ On finding representative non-dominated points for bi-objective integer network flow problems ⋮ Representation of the non-dominated set in biobjective discrete optimization ⋮ A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ Bound sets for biobjective combinatorial optimization problems ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ On the quality of discrete representations in multiple objective programming ⋮ Distribution based representative sets for multi-objective integer programs ⋮ An exact algorithm for biobjective integer programming problems ⋮ Computing representations using hypervolume scalarizations ⋮ Split algorithms for multiobjective integer programming problems ⋮ On the worst-case optimal multi-objective global optimization ⋮ An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs ⋮ Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods ⋮ Generating equidistant representations in biobjective programming ⋮ Equispaced Pareto front construction for constrained bi-objective optimization ⋮ A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming ⋮ Obtaining an outer approximation of the efficient set of nonlinear biobjective problems ⋮ Finding representative systems for discrete bicriterion optimization problems ⋮ Finding representations for an unconstrained bi-objective combinatorial optimization problem ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes ⋮ A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions ⋮ Covers and approximations in multiobjective optimization ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ Discrete representation of non-dominated sets in multi-objective linear programming ⋮ Discrete representation of the non-dominated set for multi-objective optimization problems using kernels ⋮ Using support vector machines to learn the efficient set in multiple objective discrete optimization ⋮ Stochastic convergence of random search methods to fixed size Pareto front approximations ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ A regression study of the number of efficient extreme points in multiple objective linear programming ⋮ Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems ⋮ A model of anytime algorithm performance for bi-objective optimization ⋮ Implicit enumeration strategies for the hypervolume subset selection problem ⋮ Performance indicators in multiobjective optimization ⋮ A radial boundary intersection aided interior point method for multi-objective optimization ⋮ DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization ⋮ Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization ⋮ An approximation to the nondominated set of a multiobjective linear fractional programming problem ⋮ Comments on: ``Static and dynamic source locations in undirected networks ⋮ A genetic algorithm for a bicriteria supplier selection problem ⋮ A Constraint Method in Nonlinear Multi-Objective Optimization ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ Approximation methods in multiobjective programming ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach ⋮ Decision space robustness for multi-objective integer linear programming
This page was built for publication: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
