Focal Interest
Focal Interest

Complexity and Algorithms in Graphs

External reference: https://openalex.org/T10720

  1. Parallel conflict graph management reduced MIP solve time
    Parallel algorithms for conflict graph management in mixed-integer programming enable larger cutting plane pools and substantially reduce solver times, especially for difficult problem instances.