External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Maria-Florina Balcan

This author has not been identified. Look up 'Maria-Florina Balcan' in Google

Siddharth Prasad

This author has not been identified. Look up 'Siddharth Prasad' in Google

Tuomas Sandholm

This author has not been identified. Look up 'Tuomas Sandholm' in Google

Ellen Vitercik

This author has not been identified. Look up 'Ellen Vitercik' in Google
runs on