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

Cite

Text

Bessa et al. "Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning." AAAI Conference on Artificial Intelligence, 2025. doi:10.1609/AAAI.V39I11.33208

Markdown

[Bessa et al. "Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning." AAAI Conference on Artificial Intelligence, 2025.](https://mlanthology.org/aaai/2025/bessa2025aaai-learning/) doi:10.1609/AAAI.V39I11.33208

BibTeX

@inproceedings{bessa2025aaai-learning,
  title     = {{Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning}},
  author    = {Bessa, Swann and Dabert, Darius and Bourgeat, Max and Rousseau, Louis-Martin and Cappart, Quentin},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2025},
  pages     = {11113-11121},
  doi       = {10.1609/AAAI.V39I11.33208},
  url       = {https://mlanthology.org/aaai/2025/bessa2025aaai-learning/}
}