Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/926
Title: | On nadir points of multiobjective integer programming problems | Authors: | Özpeynirci, Özgür | Keywords: | Nadir point Multiobjective integer programming problem Exact algorithm Algorithm Values Set |
Publisher: | Springer | Abstract: | In this study, we consider the nadir points of multiobjective integer programming problems. We introduce new properties that restrict the possible locations of the nondominated points necessary for computing the nadir points. Based on these properties, we reduce the search space and propose an exact algorithm for finding the nadir point of multiobjective integer programming problems. We present an illustrative example on a three objective knapsack problem. We conduct computational experiments and compare the performances of two recent algorithms and the proposed algorithm. | URI: | https://doi.org/10.1007/s10898-017-0534-9 https://hdl.handle.net/20.500.14365/926 |
ISSN: | 0925-5001 1573-2916 |
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 | |
---|---|---|---|
926.pdf Restricted Access | 756.45 kB | Adobe PDF | View/Open Request a copy |
CORE Recommender
SCOPUSTM
Citations
2
checked on Nov 6, 2024
WEB OF SCIENCETM
Citations
2
checked on Nov 6, 2024
Page view(s)
128
checked on Nov 11, 2024
Download(s)
6
checked on Nov 11, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.