The node capacitated graph partitioning problem: a computational study CE Ferreira, A Martin, CC de Souza, R Weismantel, LA Wolsey Mathematical programming 81, 229-256, 1998 | 154 | 1998 |
Efficient datapath merging for partially reconfigurable architectures N Moreano, E Borin, C De Souza, G Araujo IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2005 | 142 | 2005 |
Formulations and valid inequalities for the node capacitated graph partitioning problem CE Ferreira, A Martin, CC de Souza, R Weismantel, LA Wolsey Mathematical Programming 74, 247-266, 1996 | 120 | 1996 |
The vertex separator problem: a polyhedral investigation E Balas, CC Souza Mathematical Programming 103 (3), 583-608, 2005 | 84 | 2005 |
Hybrid column generation approaches for urban transit crew management problems TH Yunes, AV Moura, CC De Souza Transportation Science 39 (2), 273-288, 2005 | 84 | 2005 |
Scheduling projects with labor constraints C Cavalcante, C de Souza, M Savelsbergh, L Wolsey Discrete Applied Mathematics 112 (1-3), 27-52, 2001 | 83 | 2001 |
The edge-weighted clique problem: valid inequalities, facets and polyhedral computations EM Macambira, CC De Souza European Journal of Operational Research 123 (2), 346-371, 2000 | 83 | 2000 |
The vertex separator problem: algorithms and computations C Souza, E Balas Mathematical Programming 103 (3), 609-631, 2005 | 64 | 2005 |
Vehicle and crew scheduling for urban bus lines MM Rodrigues, CC de Souza, AV Moura European Journal of Operational Research 170 (3), 844-862, 2006 | 62 | 2006 |
An exact algorithm for minimizing vertex guards on art galleries MC Couto, PJ de Rezende, CC de Souza International Transactions in Operational Research 18 (4), 425-448, 2011 | 60 | 2011 |
Constructing nurse schedules at large hospitals TM Dias, DF Ferber, CC De Souza, AV Moura International Transactions in Operational Research 10 (3), 245-265, 2003 | 57 | 2003 |
The maximum common edge subgraph problem: A polyhedral investigation L Bahiense, G Manić, B Piva, CC De Souza Discrete Applied Mathematics 160 (18), 2523-2541, 2012 | 53 | 2012 |
A hybrid model for a multiproduct pipeline planning and scheduling problem TMT Lopes, AA Ciré, CC de Souza, AV Moura Constraints 15, 151-189, 2010 | 52 | 2010 |
An exact and efficient algorithm for the orthogonal art gallery problem MC Couto, CC De Souza XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI …, 2007 | 45 | 2007 |
A branch-and-cut-and-price approach for the capacitated m-ring–star problem EA Hoshino, CC De Souza Discrete Applied Mathematics 160 (18), 2728-2741, 2012 | 41 | 2012 |
Planning and scheduling the operation of a very large oil pipeline network AV Moura, CC de Souza, AA Cire, TMT Lopes Principles and Practice of Constraint Programming: 14th International …, 2008 | 41 | 2008 |
Optimal rectangular partitions FC Calheiros, A Lucena, CC de Souza Networks: An International Journal 41 (1), 51-67, 2003 | 41 | 2003 |
Engineering art galleries PJ de Rezende, CC de Souza, S Friedrichs, M Hemmer, A Kröller, ... Algorithm Engineering: Selected Results and Surveys, 379-417, 2016 | 40 | 2016 |
Solving very large crew scheduling problems to optimality TH Yunes, AV Moura, CC De Souza Proceedings of the 2000 ACM symposium on Applied computing-Volume 1, 446-451, 2000 | 37 | 2000 |
Point guards and point clouds: Solving general art gallery problems D Borrmann, PJ de Rezende, CC de Souza, SP Fekete, S Friedrichs, ... Proceedings of the twenty-ninth annual symposium on Computational geometry …, 2013 | 36 | 2013 |