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: There exists a method to reduce a 3-SAT (Satifiability) problem to a Subset Sum Problem (SSP) in the literature, however, it can only be applied to small or medium size problems. Our study ...

The Journal of the Operational Research Society, Vol. 64, No. 10 (OCTOBER 2013), pp. 1557-1569 (13 pages) The common difficulty in solving a Binary Linear Programming (BLP) problem is uncertainties in ...

※本稿はテックブログからの転載です。 Sudoku is a logic-based number placement puzzle that consists of 81 cells which are divided into 9 columns, rows and blocks. The goal of this game is to fill out each cells with ...

Abstract: This paper deals with the online fault diagnosis problem of discrete event systems under malicious external attacks. We consider a scenario where an attacker can intercept certain sensor ...

In this paper, a decision problem involving a car parts manufacturing company is modeled in order to prepare the company for an increase in demand. Mixed-integer linear programming was used with the ...

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 ...