Efficient computation of the search region in multi-objective optimization
type: Item
instance of: scholarly article
title: Efficient computation of the search region in multi-objective optimization
zbMATH Open document ID: 1403.90602
author: Kerstin Dächert
author: Kathrin Klamroth
author: Renaud Lacour
author: Daniel Vanderpooten
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6875817
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: nondominated set
zbMATH Keywords: search region
zbMATH Keywords: local upper bounds
zbMATH Keywords: scalarization
describes a project that uses: MOIP_AIRA
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.05.029
OpenAlex ID: W2407151459
cites work: Bicriteria Transportation Problem
cites work: Voronoi diagrams in higher dimensions under certain polyhedral distance functions
cites work: Bringing Order to Special Cases of Klee’s Measure Problem
cites work: An algorithm for the bi-criterion integer programming problem
cites work: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
cites work: \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
cites work: Efficient Colored Orthogonal Range Counting
cites work: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
cites work: On the representation of the search region in multi-objective optimization
cites work: An algorithm for the multiple objective integer linear programming problem
cites work: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
cites work: Multi-objective integer programming: an improved recursive algorithm
cites work: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
cites work: An improved algorithm for solving biobjective integer programs
cites work: A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
cites work: A method for finding the set of non-dominated vectors for multiple objective integer linear programs
cites work: Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
cites work: Q4889471
cites work: Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
DOI: 10.1016/J.EJOR.2016.05.029
description: scientific article; zbMATH DE number 6875817