Improved Sample Complexity Bounds for Branch-And-Cut

Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik. Improved Sample Complexity Bounds for Branch-And-Cut. In Christine Solnon, editor, 28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel. Volume 235 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

@inproceedings{BalcanPSV22,
  title = {Improved Sample Complexity Bounds for Branch-And-Cut},
  author = {Maria-Florina Balcan and Siddharth Prasad and Tuomas Sandholm and Ellen Vitercik},
  year = {2022},
  doi = {10.4230/LIPIcs.CP.2022.3},
  url = {https://doi.org/10.4230/LIPIcs.CP.2022.3},
  researchr = {https://researchr.org/publication/BalcanPSV22},
  cites = {0},
  citedby = {0},
  booktitle = {28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel},
  editor = {Christine Solnon},
  volume = {235},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-240-2},
}