6128 eng reportzib 0 -- 2016-01-12 -- 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. 1438-0064 urn:nbn:de:0297-zib-61286 Sebastian Schenker Sebastian Schenker Ralf Borndörfer Martin Skutella 16-55 DISCRETE MATHEMATICS Integer programming Multi-objective and goal programming Mathematical Optimization Mathematics of Transportation and Logistics Borndörfer, Ralf MODAL-SynLab CRC1026 MODAL-Gesamt Applied Optimization https://opus4.kobv.de/opus4-zib/files/6128/report_16-55.pdf