<div class="csl-bib-body">
<div class="csl-entry">Voboril, F., Peruvemba Ramaswamy, V., & Szeider, S. (2025). Balancing Latin Rectangles with LLM-Generated Streamliners. In M. Garcia de la Banda (Ed.), <i>31st International Conference on Principles and Practice of Constraint Programming (CP 2025)</i>. Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.CP.2025.36</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/225652
-
dc.description.abstract
We present an integration of Large Language Models (LLMs) with streamlining techniques to find well-balanced Latin rectangles. Our approach combines LLM-generated streamlining constraints that effectively partition the search space, directing constraint solvers toward structured subspaces containing high-quality solutions. Our methodology extends LLM-generated streamliners, as Voboril et al. (2024) introduced for decision problems, to the optimization context through techniques that incrementally refine the objective function value.
We propose two complementary strategies to orchestrate sets of streamliners: an incremental mechanism that utilizes improving solutions to initialize subsequent search processes, and an evolutionary framework that maintains and refines effective streamliner populations. Our experiments demonstrate that our approach successfully reduces established minimum imbalance values for partially spatially balanced Latin rectangles across multiple problem dimensions. The results validate the efficacy of combining LLMs with constraint programming methodologies for tackling problems characterized by complex global constraints.
en
dc.language.iso
en
-
dc.relation.ispartofseries
Leibniz International Proceedings in Informatics (LIPIcs)
-
dc.subject
Balanced Latin Rectangles
en
dc.subject
Evolutionary Search
en
dc.subject
Large Language Models
en
dc.subject
Streamliners
en
dc.subject
Warm-starts
en
dc.title
Balancing Latin Rectangles with LLM-Generated Streamliners
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.contributor.editoraffiliation
Monash University, Australia
-
dc.relation.isbn
978-3-95977-380-5
-
dc.relation.issn
1868-8969
-
dc.type.category
Full-Paper Contribution
-
tuw.booktitle
31st International Conference on Principles and Practice of Constraint Programming (CP 2025)
-
tuw.container.volume
340
-
tuw.peerreviewed
true
-
tuw.relation.publisher
Schloss Dagstuhl
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
tuw.publication.orgunit
E056-13 - Fachbereich LogiCS
-
tuw.publication.orgunit
E056-23 - Fachbereich Innovative Combinations and Applications of AI and ML (iCAIML)
-
tuw.publisher.doi
10.4230/LIPIcs.CP.2025.36
-
dc.description.numberOfPages
17
-
tuw.author.orcid
0009-0005-5683-5386
-
tuw.author.orcid
0000-0002-3101-2085
-
tuw.author.orcid
0000-0001-8994-1656
-
tuw.editor.orcid
0000-0002-6666-514X
-
tuw.event.name
31st International Conference on Principles and Practice of Constraint Programming (CP 2025)
en
tuw.event.startdate
10-08-2025
-
tuw.event.enddate
15-08-2025
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Glasgow
-
tuw.event.country
GB
-
tuw.event.presenter
Voboril, Florentina
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
item.fulltext
no Fulltext
-
item.languageiso639-1
en
-
item.grantfulltext
none
-
item.openairetype
conference paper
-
item.cerifentitytype
Publications
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity