This paper describes an exact [epsilon]-constraint method for bi-objective combinatorial optimization problems with integer objective values. This method tackles multi-objective optimization problems by solving a series of single objective subproblems, where all but one objectives are...

We address a generalization of the asymmetric Traveling Salesman Problem where routes have to be constructed to satisfy customer requests, which either involve the pickup or delivery of a single commodity. A vehicle is to be routed such that the demand and the supply of the customers is...

This paper formulates an optimal design model for assembly/disassembly manufacturing networks. The objective is to maximize production rate subject to a total cost constraint. Machines are chosen from a list of products available on the market, and sizes of the buffers are chosen within a...