Algorithms for solving linear constraints over the set \0, 1\

DOI10.1007/S10559-025-00822-7MaRDI QIDQ6856293zbMATH OpenFDO

Authors S. L. Kryvyi, O. V. Chugaenko, S. M. Krasnits'kyj

Publication date 19 February 2026

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10559-025-00822-7

zbMATH Keywords

01-solutionalgorithmslinear constraints

Mathematics Subject Classification ID

Diophantine equations (11Dxx) Computational number theory (11Yxx) Numerical linear algebra (65Fxx)

Cites work

• An efficient incremental algorithm for solving systems of linear diophantine equations
• Avoiding slack variables in the solving of linear diophantine equations and inequations
• Efficient solution of linear diophantine equations
• On algorithms for solving systems of linear Diophantine constraints over the set \{0,1\}

This page was built for publication: Algorithms for solving linear constraints over the set \(\{0, 1\}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6856293)