Article thumbnail

Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming

By John Sylva and Alejandro Crema

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 comparision with our previous efforts shows the method has relatively good time performance

Topics: Integer Programming, Multiple Objective Programming, Parametric Programming.
Publisher: EDP Sciences
Year: 2008
DOI identifier: 10.1051/ro:2008018/pdf
OAI identifier: oai:edpsciences.org:dkey/10.1051/ro:2008018
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://www.rairo-ro.org/10.10... (external link)
  • https://doi.org/10.1051/ro:200... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.