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.

On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs

Max Gläser, Marc E. Pfetsch. On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs. In Karen Aardal, Laura Sanità, editors, Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings. Volume 13265 of Lecture Notes in Computer Science, pages 291-304, Springer, 2022. [doi]

Authors

Max Gläser

This author has not been identified. Look up 'Max Gläser' in Google

Marc E. Pfetsch

This author has not been identified. Look up 'Marc E. Pfetsch' in Google
runs on