Constraint Satisfaction and Optimization
External reference: https://openalex.org/T11596
- Conditional splitting holds for c-representations and weakly consistent bases
-
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.

