2 papers
cs.DS2019
Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes
Janniele A. S. Araujo, Haroldo Gambini Santos, Bernard Gendron +3
Resource Constrained Project Scheduling Problems (RCPSPs) without preemption are well-known NP-hard combinatorial optimization problems. A feasible RCPSP solution consists of a tim…
cs.DS2019
Preprocessing and Cutting Planes with Conflict Graphs
Samuel S. Brito, Haroldo G. Santos
This paper addresses the development of conflict graph-based algorithms and data structures into the COIN-OR Branch-and-Cut (CBC) solver, including: an efficient infrastructu…