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

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

Abstract: Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose novel ...

Model abstraction for finite state automata is helpful for decreasing computational complexity and improving comprehensibility for the verification and control synthesis of discrete-event systems (DES ...

Abstract: We develop a framework for linear-programming (LP) decoding of non-binary linear codes over rings. We prove that the resulting LP decoder has the `maximum likelihood certificate' property, ...

This article introduces the Hybrid Quantum-Classical Multi-Cut Benders’ Decomposition (HQC-Bend) algorithm, an efficient, open-source Python script designed to tackle complex Mixed-Binary Linear ...