Learn More
We describe two variants of a tabu search heuristic, a deterministic one and a probabilistic one, for the maximum clique problem. This heuristic may be viewed as a natural alternative implementation of tabu search for this problem when compared to existing ones. We also present a new random graph generator, the/S-generator, which produces graphs with larger(More)
Technical analysis is aimed at devising trading rules capable of exploiting short-term uctuations on the ÿnancial markets. Recent results indicate that this market timing approach may be a viable alternative to the buy-and-hold approach, where the assets are kept over a relatively long time period. In this paper, we propose genetic programming as a means to(More)
A common telecommunications network design strategy, in order to protect it against failures, is to achieve a decomposition into a set of rings covering the network. We propose an algorithm for the corresponding constrained cycle cover problem which draws from constraint programming and graph algorithms. Optimal solutions are obtained ef-ciently on networks(More)
We discuss the problem of constructing physician schedules in emergency rooms. Starting from practical instances encountered in six different hospitals of the Montreal (Canada) area, we first we propose generic forms for the constraints encountered in this context. We then review several possible solution techniques that can be applied to physician(More)
This paper explains how local branching can be used to accelerate the classical Benders decomposition algorithm. By applying local branching throughout the solution process, one can simultaneously improve both the lower and upper bounds. We also show how Benders feasibility cuts can be strenghtened or replaced with local branching constraints. To assess the(More)
Given a surgery department comprising several specialties that share a fixed number of operating rooms and post-surgery beds, we study the joint operating room (OR) planning and advanced scheduling problem. More specifically, we consider the problem of determining, over a one week planning horizon, the allocation of OR time blocks to specialties together(More)
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertices is achieved through a network of fiber optic cables. Since each cable has an associated capacity (bandwidth), enough capacity must be installed on the links of the network to(More)