Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/2285
Title: | An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs | Authors: | Özpeynirci, Özgür Koksalan, Murat |
Keywords: | multiobjective optimization nondominated points exact algorithm Outcome Set Weight Set |
Publisher: | Informs | Abstract: | In this paper, we present an exact algorithm to find all extreme supported nondominated points of multiobjective mixed integer programs. The algorithm uses a composite linear objective function and finds all the desired points in a finite number of steps by changing the weights of the objective functions in a systematic way. We develop further variations of the algorithm to improve its computational performance and demonstrate our algorithm's performance on multiobjective assignment, knapsack, and traveling salesperson problems with three and four objectives. | URI: | https://doi.org/10.1287/mnsc.1100.1248 https://hdl.handle.net/20.500.14365/2285 |
ISSN: | 0025-1909 |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Files in This Item:
File | Size | Format | |
---|---|---|---|
2285.pdf Restricted Access | 2.13 MB | Adobe PDF | View/Open Request a copy |
CORE Recommender
SCOPUSTM
Citations
67
checked on Aug 14, 2024
WEB OF SCIENCETM
Citations
63
checked on Aug 14, 2024
Page view(s)
120
checked on Aug 19, 2024
Download(s)
4
checked on Aug 19, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.