An Algorithm for Multiobjective Zero-One Linear Programming

Gülseren Kiziltan and Erkut Yucao\u{g}lu
Additional contact information
Gülseren Kiziltan: Marmara Scientific and Industrial Research Institute, Kocaeli, Turkey
Erkut Yucao\u{g}lu: Turkish Electrical Industries Corporation, Istanbul, Turkey

Management Science, 1983, vol. 29, issue 12, 1444-1453

Abstract: A branch and bound algorithm is presented which is based on the extension of implicit enumeration techniques to multiobjective zero-one linear programming and which appears to be computationally quite efficient. Domination tests, aiming at identifying paths of the enumeration tree that lead to dominated solutions as high up the tree as possible, are developed. Some computational results are also given.

Keywords: programming:; multiple; criteria (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (22)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.29.12.1444 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:29:y:1983:i:12:p:1444-1453

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().