Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming

From MaRDI portal
Revision as of 01:44, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1575074

DOI10.1007/S101070050128zbMath0970.90090OpenAlexW4233783227MaRDI QIDQ1575074

Serpil Sayın

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 problemThe \(L\)-shape search method for triobjective integer programmingAlgorithm robust for the bicriteria discrete optimization problemSolution approaches for equitable multiobjective integer programming problemsBilevel programming for generating discrete representations in multiobjective optimizationOn finding representative non-dominated points for bi-objective integer network flow problemsRepresentation of the non-dominated set in biobjective discrete optimizationA method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programsApproximation Methods for Multiobjective Optimization Problems: A SurveyBound sets for biobjective combinatorial optimization problemsBranch-and-Bound for Biobjective Mixed-Integer Linear ProgrammingOn the quality of discrete representations in multiple objective programmingDistribution based representative sets for multi-objective integer programsAn exact algorithm for biobjective integer programming problemsComputing representations using hypervolume scalarizationsSplit algorithms for multiobjective integer programming problemsOn the worst-case optimal multi-objective global optimizationAn upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimizationAdaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programsObtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methodsGenerating equidistant representations in biobjective programmingEquispaced Pareto front construction for constrained bi-objective optimizationA Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear ProgrammingObtaining an outer approximation of the efficient set of nonlinear biobjective problemsFinding representative systems for discrete bicriterion optimization problemsFinding representations for an unconstrained bi-objective combinatorial optimization problemRepresenting the nondominated set in multi-objective mixed-integer programsIntegrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmesA coverage-based box-algorithm to compute a representation for optimization problems with three objective functionsCovers and approximations in multiobjective optimizationFinding a representative nondominated set for multi-objective mixed integer programsDiscrete representation of non-dominated sets in multi-objective linear programmingDiscrete representation of the non-dominated set for multi-objective optimization problems using kernelsUsing support vector machines to learn the efficient set in multiple objective discrete optimizationStochastic convergence of random search methods to fixed size Pareto front approximationsApproximative 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 programmingTheoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problemsA model of anytime algorithm performance for bi-objective optimizationImplicit enumeration strategies for the hypervolume subset selection problemPerformance indicators in multiobjective optimizationA radial boundary intersection aided interior point method for multi-objective optimizationDMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimizationEquidistant representations: connecting coverage and uniformity in discrete biobjective optimizationAn approximation to the nondominated set of a multiobjective linear fractional programming problemComments on: ``Static and dynamic source locations in undirected networksA genetic algorithm for a bicriteria supplier selection problemA Constraint Method in Nonlinear Multi-Objective OptimizationFPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programmingApproximation methods in multiobjective programmingNew \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approachDecision 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