We develop exact algorithms for multi-objective integer programming (MIP) problems. The algorithms iteratively generate nondominated points and exclude the regions that are dominated by the previously-generated nondominated points. One algorithm generates new points by solving models with...

We propose an evolutionary metaheuristic for approximating the preference-nondominated solutions of a decision maker in multiobjective combinatorial problems. The method starts out with some partial preference information provided by the decision maker, and utilizes an individualized fitness...

We propose a data envelopment analysis (DEA)-based approach to ranking multi-criteria alternatives. We call it "the area of the efficiency score graph" (AES) approach. Unlike the classical DEA score and Dk measure that counts the number of DMUs (alternatives in DEA terminology) that should be...

In this paper we consider a kit planning problem where demand occurrences are not for individual items, but for kits (a group of items). Each kit contains an arbitrary number of items. Kit demands occur according to a Poisson process. Whenever a kit demand occurs, only one item from the kit is...