We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1 2 approximation algorithm and prove its ...
As product life cycles shortened, many firms introduce new products and phase out old products frequently. To plan for a successful product rollover; i.e., introduce a new product...
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...
A tabu search approach to solve multi-objective combinatorial optimization problems is developed in this paper. This procedure selects an objective to become active for a given it...
Sadan Kulturel-Konak, Alice E. Smith, Bryan A. Nor...
We consider multi-period portfolio selection problems for a decision maker with a specified utility function when the variance of security returns is described by a discrete time ...