An Algorithm for Multiobjective Zero-One Linear Programming

1 December 1983

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science

Vol. 29 (12) , 1444-1453
https://doi.org/10.1287/mnsc.29.12.1444

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

MULTIOBJECTIVE ZERO
DOMINATED SOLUTIONS
COMPUTATIONAL RESULTS
BOUND ALGORITHM
ENUMERATION TECHNIQUES
IMPLICIT ENUMERATION
ENUMERATION TREE
IDENTIFYING PATHS

This publication has 0 references indexed in Scilit: