Giulia Zarpellon, Jason Jo, Andrea Lodi and Yoshua Bengio
Paper (2021)
An external link is available for this item
| Department: | Department of Mathematics and Industrial Engineering |
|---|---|
| PolyPublie URL: | https://publications.polymtl.ca/49124/ |
| Conference Title: | 35th AAAI Conference on Artificial Intelligence / 33rd Conference on Innovative Applications of Artificial Intelligence / 11th Symposium on Educational Advances in Artificial Intelligence |
| Conference Location: | En ligne / Online |
| Conference Date(s): | 2021-02-02 - 2021-02-09 |
| Journal Title: | Proceedings of the ... AAAI Conference on Artificial Intelligence (vol. 35, no. 5) |
| Publisher: | Assoc Advancement Artificial Intelligence |
| DOI: | 10.1609/aaai.v35i5.16512 |
| Official URL: | https://doi.org/10.1609/aaai.v35i5.16512 |
| Date Deposited: | 18 Apr 2023 15:00 |
| Last Modified: | 19 Sep 2023 14:00 |
| Cite in APA 7: | Zarpellon, G., Jo, J., Lodi, A., & Bengio, Y. (2021, February). Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies [Paper]. 35th AAAI Conference on Artificial Intelligence / 33rd Conference on Innovative Applications of Artificial Intelligence / 11th Symposium on Educational Advances in Artificial Intelligence, En ligne / Online. Published in Proceedings of the ... AAAI Conference on Artificial Intelligence, 35(5). https://doi.org/10.1609/aaai.v35i5.16512 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
