Article ID Journal Published Year Pages File Type
1142422 Operations Research Letters 2013 4 Pages PDF
Abstract

In this paper we formulate and prove two upper bounds for the nondominated set of multi-objective combinatorial optimization problems with integer coefficients. We also show that under certain assumptions, reasonable and applicable in the majority of practical problems, the number of nondominated points grows following a polynomial function.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On the cardinality of the nondominated set of multi-objective combinatorial optimization problems
Authors
, , ,