Enumerating the set of non-dominated vectors in multiple objective integer linear programming

Enumerating the set of non-dominated vectors in multiple objective integer linear programming

0.00 Avg rating0 Votes
Article ID: iaor200944754
Country: France
Volume: 42
Issue: 3
Start Page Number: 371
End Page Number: 387
Publication Date: Jul 2008
Journal: RAIRO Operations Research
Authors: ,
Keywords: programming: integer
Abstract:

An algorithm for enumerating all nondominated vectors of multiple objective integer linear programs is presented. The method tests different regions where candidates can be found using an auxiliary binary problem for tracking the regions already explored. An experimental comparison with our previous efforts shows the method has relatively good time performance.

Reviews

Required fields are marked *. Your email address will not be published.