A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems

From MaRDI portal
Publication:2255968

DOI10.1016/j.ejor.2013.08.001zbMath1305.90368OpenAlexW2045560222WikidataQ59317575 ScholiaQ59317575MaRDI QIDQ2255968

Serpil Sayın, Gokhan Kirlik

Publication date: 18 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.08.001




Related Items (55)

An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional programA branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approachThe \(L\)-shape search method for triobjective integer programmingRobust optimization for the cyclic hoist scheduling problemPlanning sustainable routes: economic, environmental and welfare concernsOn the representation of the search region in multi-objective optimizationA multi-criteria approach for hospital capacity analysisSolution approaches for equitable multiobjective integer programming problemsBilevel programming for generating discrete representations in multiobjective optimizationA multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methodsAn interactive approximation algorithm for multi-objective integer programsNondominated Nash points: application of biobjective mixed integer programmingBranch-and-Bound for Biobjective Mixed-Integer Linear ProgrammingNetwork Models for Multiobjective Discrete OptimizationDistribution based representative sets for multi-objective integer programsA decision space algorithm for multiobjective convex quadratic integer optimizationSplit algorithms for multiobjective integer programming problemsWarm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programsOn nadir points of multiobjective integer programming problemsBranch-and-bound and objective branching with three or more objectivesAlgorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problemsA matheuristic for tri-objective binary integer linear programmingA criterion space decomposition approach to generalized tri-objective tactical resource allocationA criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approachEffective anytime algorithm for multiobjective combinatorial optimization problemsOptimizing a linear function over the nondominated set of multiobjective integer programsA Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear ProgrammingDisjunctive Programming for Multiobjective Discrete OptimisationA New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear ProgramsReducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programmingRepresenting the nondominated set in multi-objective mixed-integer programsA coverage-based box-algorithm to compute a representation for optimization problems with three objective functionsA multi-objective, hub-and-spoke model to design and manage biofuel supply chainsFinding a representative nondominated set for multi-objective mixed integer programsWeighted sum model with partial preference information: application to multi-objective optimizationEfficient computation of the search region in multi-objective optimizationThe quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programsPreprocessing and cut generation techniques for multi-objective binary programmingOn finding the optimal BDD relaxationAn exact parallel objective space decomposition algorithm for solving multi-objective integer programming problemsMulti-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programsSolving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizationsAn exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test setsBranching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programmingA Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box MethodHalf-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspectsAn extension of the non-inferior set estimation algorithm for many objectivesMultiobjective Integer Programming: Synergistic Parallel ApproachesComments on: ``Static and dynamic source locations in undirected networksEnumeration of the Nondominated Set of Multiobjective Discrete Optimization ProblemsA computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problemFPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programmingA linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problemsNew \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approachComputing the nadir point for multiobjective discrete optimization problems


Uses Software


Cites Work


This page was built for publication: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems