We present an algorithm to compute the (pre)-kernel of a TU-game N, v with a system of n 2 1 linear programming problems. In contrast to the algorithms using convergence methods t...
In this paper, we study a bidding problem which can be modeled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-b...
In this paper the one-machine scheduling problem with linear earliness and tardiness costs is considered. The7 cost functions are job dependent and asymmetric. The problem consist...
Crossdocking studies have mostly been concerned with the physical layout of a crossdock or on a single crossdock. In this work, we study a network of crossdocks taking into consid...
Ping Chen, Yunsong Guo, Andrew Lim, Brian Rodrigue...
Focus is here on coalitional games among economic agents plagued by aggregate pollutions of diverse sorts. Any contracting player presumably pollutes less than if he defects. In a...