Search Results - "Brito, Samuel S."

Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes by Araujo, Janniele A.S., Santos, Haroldo G., Gendron, Bernard, Jena, Sanjay Dominik, Brito, Samuel S., Souza, Danilo S.

“…•A new effective preprocessing algorithm for compact formulations was proposed.•The proposed cutting plane algorithm produced improved dual bounds for all…”
Get full text

A SA-VNS approach for the High School Timetabling Problem by Brito, Samuel S., Fonseca, George H.G., Toffolo, Tulio A.M., Santos, Haroldo G., Souza, Marcone J.F.

“…The High School Timetabling Problem consists in assigning timeslots and resources to events, satisfying constraints which heavily depend on the specific…”
Get full text

Preprocessing and Cutting Planes with Conflict Graphs by Brito, Samuel S, Santos, Haroldo G

“…Computers & Operations Research, 128, 105176 (2020) This paper addresses the development of conflict graph-based algorithms and data structures into the…”
Get full text

Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes by Araujo, Janniele A. S, Santos, Haroldo Gambini, Gendron, Bernard, Jena, Sanjay Dominik, Brito, Samuel S, Souzaa, Danilo S

“…Computers & Operations Research (2019) Resource Constrained Project Scheduling Problems (RCPSPs) without preemption are well-known NP-hard combinatorial…”
Get full text