Consider the collection of all binary matrices having a specific sequence of row and column sums and consider sampling binary matrices uniformly from this collection. Practical algorithms for exact uniform sampling are not known, but there are practical algorithms for approximate uniform sampling. Here it is shown how dynamic programming and recent asymptotic enumeration results can be used to ...

In this article we discuss the presentation of a random binary matrix using sequence of whole nonnegative numbers. We examine some advantages and disadvantages of this presentation as an alternative of the standard presentation using two-dimensional array. It is shown that the presentation of binary matrices using ordered n-tuples of natural numbers makes the algorithms faster and saves a lot o...

This paper presents an improved lower bound and an approximation algorithm based on spectral decomposition for the binary constrained quadratic programming problem. To decompose spectrally the quadratic matrix in the objective function, we construct a low rank problem that provides a lower bound. Then an approximation algorithm for the binary quadratic programming problem together with a worst ...

Two binary integer programming discrete-time models and two precedence-based mixed integer programming continuous-time formulations are developed for the resource-constrained project scheduling problem. The discrete-time models are based on the definition of binary variables that describe the processing state of every activity between two consecutive time points, while the continuous-time model...

It has been widely known that complete decoding for binary linear codes can be regarded as an linear integer programming problem with binary arithmetic conditions. Conti and Traverso [8] have proposed an efficient algorithm which uses Gröbner bases to solve integer programming with ordinary integer arithmetic conditions. Ikegami and Kaji [11] extended the Conti-Traverso algorithm to solve integ...

Cross-platform object-level coherence in Web services-based distributed systems and grids requires lossless serialization to ensure programming-language specific objects are safely transmitted, manipulated, and stored. However, Web services development tools often suffer from lossy forms of XML serialization, which diminishes the usefulness of XML Web services as a competitive approach to binar...

2×2-Sudoku (or ShiDoku) is a sized down variant of the usual 3×3-Sudoku puzzle. Its set of constraints contains 56 binary inequalities. It is proven that any maximal redundant set of these binary inequalities has size 16. This is in line with a conjecture about 3×3Sudoku. The result is achieved partly by rigorous proofs, partly by programming in Prolog. The generalization to N×N-Sudoku with N >...

Several types of relaxations for binary quadratic polynomial programs can be obtained using linear, secondorder cone, or semidefinite techniques. In this paper, we propose a general framework to construct conic relaxations for binary quadratic polynomial programs based on polynomial programming. Using our framework, we re-derive previous relaxation schemes and provide new ones. In particular, w...

Writing code that manipulates bit streams is a painful and errorprone programming task, currently often performed via bit twiddling techniques such as explicit bit shifts and bit masks in programmer-allocated buffers. Still, this kind of programming is necessary in many application areas ranging from decoding streaming media files to implementing network protocols. In this paper we show how hig...