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: Scheduling is a main issue of real-time systems because it involves meeting the deadlines. In this paper, we address the problem of scheduling a set of periodic tasks on m processors under ...

Abstract: A new method, based on binary integer programming, to solve the problem of fault section estimation in power systems is developed in this work. This optimization model is formulated based on ...

We study the use of binary variables in reformulating general mixed-integer linear programs. We show that binary reformulations result in problems for which almost all the binary variables replacing a ...

A Binary-Integer Linear Programming (BILP) model that solves sudoku puzzles. Linear Programming is done on python that wraps around CPLEX to solve system of linear equations much faster.

This program presents an algorithm designed to provide a more straightforward and easy-to-understand implementation of USCF Swiss-style pairing for chess tournaments. The core of this algorithm ...