Convex preference cone-based approach for many objective optimization problems
type: Item
instance of: scholarly article
title: Convex preference cone-based approach for many objective optimization problems
zbMATH Open document ID: 1458.90583
author: Ankur Sinha
author: Pekka Malo
author: Markku Kallio
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 6901590
zbMATH Keywords: evolutionary algorithms
zbMATH Keywords: many-objective optimization
zbMATH Keywords: interactive
zbMATH Keywords: cone contraction
zbMATH Keywords: preference-based method
MaRDI profile type: Publication
full work available at URL: j.cor.2018.02.015
OpenAlex ID: W2793021467
cites work: Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
cites work: Multi-objective optimization using evolutionary algorithms
cites work: Q4868589
cites work: Q5701623
cites work: Constructing a strict total order for alternatives characterized by multiple criteria: An extension
cites work: A Modeling Language for Mathematical Programming
cites work: Interactive evolutionary multi-objective optimization for quasi-concave preference functions
cites work: Q3070915
cites work: Cone contraction and reference point methods for multi-criteria mixed integer optimization
cites work: Dual cone approach to convex-cone dominance in multiple criteria decision making
cites work: Solving the Discrete Multiple Criteria Problem using Convex Cones
cites work: Large-scale linearly constrained optimization
cites work: An interactive evolutionary multi-objective optimization algorithm with a limited number of decision maker calls
cites work: Q3815146
cites work: Q3875728
Wikidata QID: Q130154201
DOI: 10.1016/J.COR.2018.02.015
description: scientific article; zbMATH DE number 6901590