A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented.

Abstract: This paper considers a dynamic spectrum allocation (DSA) for efficient distribution of the spectrum resource by allocating the spectrum to be responsive to demand variations. In this DSA ...

Integer programming and combinatorial optimization form the backbone of many decision-making and resource allocation problems across diverse fields, from logistics and telecommunications to finance ...

Camera placement and optimisation in sensor networks is a critical area of research, combining elements of computational geometry, operations research and computer vision to enhance surveillance and ...

A major challenge in microarray classification is that the number of features is typically orders of magnitude larger than the number of examples. In this paper, we propose a novel feature filter ...

Abstract: This paper presents a new approach to the solution of resource or task allocation problems. A network flow optimization problem is posed that combines binary integer programming methods with ...

Interfaces, Vol. 42, No. 2, Analytics in Sports, Part I: General Sports Applications (March-April 2012), pp. 191-198 (8 pages) In this paper, we present a binary integer linear program for obtaining ...