论文信息 - An Algorithm for Multiobjective Zero-One Linear Programming

An Algorithm for Multiobjective Zero-One Linear Programming

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.

G. Kiziltan | E. Yucaoğlu

[1] F. Glover. A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[2] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[3] Fred Glover,et al. A Note on the Additive Algorithm of Balas , 1965 .

[4] A. M. Geoffrion. Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .

[5] Bernhard Fleischmann. Letter to the Editor - Computational Experience with the Algorithm of Balas , 1967, Oper. Res..

[6] Gabriel R. Bitran,et al. Linear multiple objective programs with zero–one variables , 1977, Math. Program..

[7] Gabriel R. Bitran,et al. Theory and algorithms for linear multiple objective programs with zero–one variables , 1979, Math. Program..

[8] Bernardo Villarreal,et al. Multicriteria integer programming: A (hybrid) dynamic programming recursive approach , 1981, Math. Program..

[9] Edward L. Hannan,et al. An algorithm for the multiple objective integer linear programming problem , 1982 .