An integer linear programming model for tilings
From MaRDI portal
Publication:6137220
Abstract: In this paper, we propose an Integer Linear Model whose solutions are the aperiodic rhythms tiling with a given rhythm A. We show how this model can be used to efficiently check the necessity of the Coven-Meyerowitz's condition and also to define an iterative algorithm that finds all the possible tilings of the rhythm A. To conclude, we run several experiments to validate the time efficiency of this model.
Recommendations
Cites work
- scientific article; zbMATH DE number 5127224 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 2202929 (Why is no real title available?)
- scientific article; zbMATH DE number 2202930 (Why is no real title available?)
- scientific article; zbMATH DE number 3058897 (Why is no real title available?)
- scientific article; zbMATH DE number 3079616 (Why is no real title available?)
- scientific article; zbMATH DE number 3081728 (Why is no real title available?)
- A Linear Programming Approach to the Cutting-Stock Problem
- A SAT encoding to compute aperiodic tiling rhythmic canons
- Algorithms for translational tiling
- An Automatic Method of Solving Discrete Programming Problems
- Complex Hadamard matrices and the spectral set conjecture
- Cutting planes in integer and mixed integer programming
- Ein Beitrag zum Problem der Faktorisation von endlichen Abelschen Gruppen
- Extended Vuza canons
- Integer Programming
- On the factorisation of finite abelian groups. III
- Rhythmic canons and Galois theory
- Rédei-matrices and applications
- The Coven-Meyerowitz tiling conditions for 3 odd prime factors
- Tiling the integers with translates of one finite set
This page was built for publication: An integer linear programming model for tilings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137220)