Global optimization with alpha‐dense curves: resolution of Boolean equations Available to Purchase

The purpose of this paper is to use α‐dense curves for solving Boolean equations, 0‐1 integer programming problems such as the shortest path problem or the knapsack problem.

The paper's aim is to present the applications in Boolean algebra and 0‐1 integer programming of a new method based on α‐dense curves first developed at the beginning of the 1980s by Yves Cherruault and Arthur Guillez. The α‐dense curves generalize the space filling curves (Peanocurves,…) and fractal curves. The main idea consists in expressing n variables by means of a single one.

Apply the method to Boolean algebra and 0‐1 integer programming.

The paper presents a new method based on α‐dense curves for solving Boolean equations and 0‐1 integer programming problems.