Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning

Swann Bessa, Darius Maxime Armand Dabert, Max Bourgeat, Louis-Martin Rousseau and Quentin Cappart

Article (2025)

An external link is available for this item

Department:	Department of Computer Engineering and Software Engineering Department of Mathematics and Industrial Engineering
PolyPublie URL:	https://publications.polymtl.ca/64489/
Journal Title:	Proceedings of the AAAI Conference on Artificial Intelligence (vol. 39, no. 11)
Publisher:	Association for the Advancement of Artificial Intelligence
DOI:	10.1609/aaai.v39i11.33208
Official URL:	https://doi.org/10.1609/aaai.v39i11.33208
Date Deposited:	14 Apr 2025 09:28
Last Modified:	14 Apr 2025 09:28

Cite in APA 7:	Bessa, S., Dabert, D. M. A., Bourgeat, M., Rousseau, L.-M., & Cappart, Q. (2025). Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning. Proceedings of the AAAI Conference on Artificial Intelligence, 39(11), 11113-11121. https://doi.org/10.1609/aaai.v39i11.33208
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Repository Staff Only