Search Results

Documents authored by Bierlee, Hendrik

Artifact
Software
DOI: 10.4230/artifacts.26917
Table Constraints for Integer Programming

Authors: Hendrik Bierlee, Wout Piessens, Tias Guns, and Peter J. Stuckey

Abstract
Cite as

Hendrik Bierlee, Wout Piessens, Tias Guns, Peter J. Stuckey. Table Constraints for Integer Programming (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@misc{dagstuhl-artifact-26917,
   title = {{Table Constraints for Integer Programming}}, 
   author = {Bierlee, Hendrik and Piessens, Wout and Guns, Tias and Stuckey, Peter J.},
   note = {Software, https://wms.cs.kuleuven.be/chat-opt, https://www.fwo.be/, https://optima.org.au/, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:1b22a434c54cd6bb28794cf6c9771f6a002e07f0;origin=https://github.com/ML-KULeuven/table-constraints-for-integer-programming;visit=swh:1:snp:993c9810181126cd29c2384d17d88d3c58cbdc58;anchor=swh:1:rev:3a9a6ff8e84d1d4ea474c2da6cf466a6be923128}{\texttt{swh:1:dir:1b22a434c54cd6bb28794cf6c9771f6a002e07f0}} (visited on 2026-07-13)},
   url = {https://github.com/ML-KULeuven/table-constraints-for-integer-programming},
   doi = {10.4230/artifacts.26917},
}
Document
DOI: 10.4230/LIPIcs.CP.2026.6
Table Constraints for Integer Programming

Authors: Hendrik Bierlee, Wout Piessens, Tias Guns, and Peter J. Stuckey

Published in: LIPIcs, Volume 379, 32nd International Conference on Principles and Practice of Constraint Programming (CP 2026)

Abstract
Global constraints are a central concept in Constraint Programming (CP), which allow modellers to compactly express complex relations, and which allow solvers to efficiently handle them. Table constraints have especially been well-studied as they can express arbitrary finite relations, and are extensively used in CP benchmarks. In this paper we study how to best deal with table constraints when using Integer Linear Programming (ILP) solvers. We study two paradigms: linear encodings, and a lazy cut generation approach. For the encoding we propose a novel MDD-based flow encoding. For the cut generation, in which lazy constraints are generated on-demand during branch-and-cut search, we investigate different ways of generating such integer and fractional cuts as well as how to strengthen them through shrinking and cut lifting. We experimentally compare the different approaches on CP competition instances with a wide variety of table constraints, showing clear benefits over the standard integer encoding.
Cite as

Hendrik Bierlee, Wout Piessens, Tias Guns, and Peter J. Stuckey. Table Constraints for Integer Programming. In 32nd International Conference on Principles and Practice of Constraint Programming (CP 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 379, pp. 6:1-6:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{bierlee_et_al:LIPIcs.CP.2026.6,
  author =	{Bierlee, Hendrik and Piessens, Wout and Guns, Tias and Stuckey, Peter J.},
  title =	{{Table Constraints for Integer Programming}},
  booktitle =	{32nd International Conference on Principles and Practice of Constraint Programming (CP 2026)},
  pages =	{6:1--6:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-432-1},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{379},
  editor =	{Beldiceanu, Nicolas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2026.6},
  URN =		{urn:nbn:de:0030-drops-266397},
  doi =		{10.4230/LIPIcs.CP.2026.6},
  annote =	{Keywords: Table constraints, integer programming, cut generation, modelling}
}
Artifact
Dataset
DOI: 10.4230/artifacts.24089
ML-KULeuven/SAT25_PB_reductions_experiments

Authors: Orestis Lomis, Jo Devriendt, Hendrik Bierlee, and Tias Guns

Abstract
Cite as

Orestis Lomis, Jo Devriendt, Hendrik Bierlee, Tias Guns. ML-KULeuven/SAT25_PB_reductions_experiments (Dataset, Experimental Results). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@misc{dagstuhl-artifact-24089,
   title = {{ML-KULeuven/SAT25\underlinePB\underlinereductions\underlineexperiments}}, 
   author = {Lomis, Orestis and Devriendt, Jo and Bierlee, Hendrik and Guns, Tias},
   note = {Dataset, This research was partly funded by the European Research Council (ERC) under the EU Horizon 2020 research and innovation programme (Grant No 101002802, CHAT-Opt)., swhId: \href{https://archive.softwareheritage.org/swh:1:dir:650c2f9b37926504a59a11a6dbf319620b311dc3;origin=https://github.com/ML-KULeuven/SAT25_PB_reductions_experiments;visit=swh:1:snp:c9843bb9ce4bf323c83b69edd5820bdb654e19be;anchor=swh:1:rev:d5b602b4b96833a077bd379b2803314349cb8548}{\texttt{swh:1:dir:650c2f9b37926504a59a11a6dbf319620b311dc3}} (visited on 2025-08-07)},
   url = {https://github.com/ML-KULeuven/SAT25_PB_reductions_experiments},
   doi = {10.4230/artifacts.24089},
}
Document
DOI: 10.4230/LIPIcs.SAT.2025.21
Improving Reduction Techniques in Pseudo-Boolean Conflict Analysis

Authors: Orestis Lomis, Jo Devriendt, Hendrik Bierlee, and Tias Guns

Published in: LIPIcs, Volume 341, 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)

Abstract
Recent pseudo-Boolean (PB) solvers leverage the cutting planes proof system to perform SAT-style conflict analysis during search. This process learns implied PB constraints, which can prune later parts of the search tree and is crucial to a PB solver’s performance. A key step in PB conflict analysis is the reduction of a reason constraint, which caused a variable propagation that contributed to the conflict. While necessary, reduction generally makes the reason constraint less strong. Consequently, different approaches to reduction have been proposed, broadly categorised as division- or saturation-based, with the aim of preserving the strength of the reason constraint as much as possible. This paper proposes two novel techniques in each reduction category. We theoretically show how each technique yields reason constraints which are at least as strong as those obtained from existing reduction methods. We then evaluate the empirical effectiveness of the reduction techniques on hard knapsack instances and the most recent PB'24 competition benchmarks.
Cite as

Orestis Lomis, Jo Devriendt, Hendrik Bierlee, and Tias Guns. Improving Reduction Techniques in Pseudo-Boolean Conflict Analysis. In 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 341, pp. 21:1-21:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{lomis_et_al:LIPIcs.SAT.2025.21,
  author =	{Lomis, Orestis and Devriendt, Jo and Bierlee, Hendrik and Guns, Tias},
  title =	{{Improving Reduction Techniques in Pseudo-Boolean Conflict Analysis}},
  booktitle =	{28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)},
  pages =	{21:1--21:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-381-2},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{341},
  editor =	{Berg, Jeremias and Nordstr\"{o}m, Jakob},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2025.21},
  URN =		{urn:nbn:de:0030-drops-237551},
  doi =		{10.4230/LIPIcs.SAT.2025.21},
  annote =	{Keywords: Constraint Programming, Pseudo-Boolean Reasoning, Conflict Analysis}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact