A novel partitioning of the set of non-dominated points

Please always quote using this URN: urn:nbn:de:0297-zib-61286
  • We consider a novel partitioning of the set of non-dominated points for general multi-objective integer programs with $k$ objectives. The set of non-dominated points is partitioned into a set of non-dominated points whose efficient solutions are also efficient for some restricted subproblem with one less objective; the second partition comprises the non-dominated points whose efficient solutions are inefficient for any of the restricted subproblems. We show that the first partition has the nice property that it yields finite rectangular boxes in which the points of the second partition are located.

Download full text files

Export metadata

  • Export Bibtex
Metadaten
Author:Sebastian Schenker, Ralf Borndörfer, Martin Skutella
Document Type:ZIB-Report
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C10 Integer programming
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C29 Multi-objective and goal programming
CCS-Classification:G. Mathematics of Computing / G.2 DISCRETE MATHEMATICS
Date of first Publication:2016/01/12
Series (Serial Number):ZIB-Report (16-55)
ISSN:1438-0064

$Rev: 13581 $