Finding all nondominated points of multi-objective integer programs

We develop exact algorithms for multi-objective integer programming (MIP) problems. The algorithms iteratively generate nondominated points and exclude the regions that are dominated by the previously-generated nondominated points. One algorithm generates new points by solving models with additional...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 57; no. 2; pp. 347 - 365
Main Authors:	Lokman, Banu, Köksalan, Murat
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.10.2013 Springer Springer Nature B.V
Subjects:	Algorithms Computer Science Decision making Experiments Graph theory Industrial engineering Integer programming Linear programming Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Methods Objectives Operations research Operations Research/Decision Theory Optimization Real Functions Searching Shortest-path problems Nondominated point Combinatorial optimization Multiple criteria
ISSN:	0925-5001, 1573-2916
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!