The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
There are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make “howlers” or not to simplify enough. In thi...
Robert M. Corless, James H. Davenport, David J. Je...