Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming
by Moncef Abbas; Mohamed El-Amine Chergui; Meriem Ait Mehdi
International Journal of Mathematics in Operational Research (IJMOR), Vol. 4, No. 3, 2012

Abstract: In this paper, a branch and bound multi-objective based method is proposed for reaching the non-dominated set. Two types of nodes are considered in the tree-search. The first type characterises the non-integer solutions found which are transformed to integer solutions by applying a branching procedure. The second type of nodes contains an integer solution and in this case efficient cuts are established in order either to remove dominated integer vectors or to fathom them. The method is compared advantageously with two exact methods of the literature tailored for the general case and also analysed computationally on benchmarks of MCDM library.

Online publication date: Sun, 15-Apr-2012

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com