Search the dblp DataBase

Publications of Author

1. Tallys H. Yunes, Arnaldo V. Moura, Cid C. de Souza
   A Hybrid Approach for Solving Large Scale Crew Scheduling Problems. [Citation Graph (0, 0)][DBLP]
   PADL, 2000, pp:293-307 [Conf]
   
2. Tallys H. Yunes, Arnaldo V. Moura, Cid C. de Souza
   Solving Very Large Crew Scheduling Problems to Optimality. [Citation Graph (0, 0)][DBLP]
   SAC (1), 2000, pp:446-451 [Conf]
   
3. Romulo A. Pereira, Arnaldo V. Moura, Cid C. de Souza
   Comparative Experiments with GRASP and Constraint Programming for the Oil Well Drilling Problem. [Citation Graph (0, 0)][DBLP]
   WEA, 2005, pp:328-340 [Conf]
   
4. Cid C. de Souza, André M. Lima, Nahri Moreano, Guido Araujo
   The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation. [Citation Graph (0, 0)][DBLP]
   WEA, 2004, pp:545-558 [Conf]
   
5. Susanne Heipcke, Yves Colombani, Cristina C. B. Cavalcante, Cid C. de Souza
   Scheduling under Labour Resource Constraints. [Citation Graph (0, 0)][DBLP]
   Constraints, 2000, v:5, n:4, pp:415-422 [Journal]
   
6. Pablo E. Coll, Celso C. Ribeiro, Cid C. de Souza
   Multiprocessor scheduling under precedence constraints: Polyhedral results. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:5, pp:770-801 [Journal]
   
7. Cid C. de Souza, M. Laurent
   Some New Classes of Facets for the Equicut Polytope. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1995, v:62, n:1-3, pp:167-191 [Journal]
   
8. Cláudio Nogueira de Meneses, Cid C. de Souza
   Exact Solutions of Rectangular Partitions via Integer Programming. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 2000, v:10, n:5, pp:477-522 [Journal]
   
9. Cid C. de Souza, André M. Lima, Guido Araujo, Nahri Moreano
   The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
   
10. Egon Balas, Cid C. de Souza
    The vertex separator problem: a polyhedral investigation. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:103, n:3, pp:583-608 [Journal]
    
11. Cid C. de Souza, Egon Balas
    The vertex separator problem: algorithms and computations. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:103, n:3, pp:609-631 [Journal]
    
12. Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza
    Optimal rectangular partitions. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:1, pp:51-67 [Journal]
    
13. Elder M. Macambira, Nelson Maculan, Cid C. de Souza
    A column generation approach for SONET ring assignment. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:3, pp:157-171 [Journal]
    
14. Nahri Moreano, Edson Borin, Cid C. de Souza, Guido Araujo
    Efficient datapath merging for partially reconfigurable architectures. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2005, v:24, n:7, pp:969-980 [Journal]
    
15. Maikol M. Rodrigues, Cid C. de Souza, Arnaldo V. Moura
    Vehicle and crew scheduling for urban bus lines. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:170, n:3, pp:844-862 [Journal]
    
16. Victor F. Cavalcante, Cid C. de Souza
    Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:471-482 [Conf]
    
17. 
    Column Generation Algorithms for the Capacitated m-Ring-Star Problem. [Citation Graph (, )][DBLP]
    
    
18. 
    An IP solution to the art gallery problem. [Citation Graph (, )][DBLP]
    
    
19. 
    Planning and Scheduling the Operation of a Very Large Oil Pipeline Network. [Citation Graph (, )][DBLP]
    
    
20. 
    An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem. [Citation Graph (, )][DBLP]
    
    
21. 
    Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem. [Citation Graph (, )][DBLP]
    
    
22. 
    Heuristics and Constraint Programming Hybridizations for a Real Pipeline Planning and Scheduling Problem. [Citation Graph (, )][DBLP]
    
    
23. 
    A Branch-and-Price Approach for the Partition Coloring Problem. [Citation Graph (, )][DBLP]
    
    
24. 
    On the Facial Structure of the Common Edge Subgraph polytope. [Citation Graph (, )][DBLP]
    
    
25. 
    Exact Algorithms for the Vertex Separator Problem in Graphs. [Citation Graph (, )][DBLP]
    
    
26. 
    Column Generation Algorithms for the Capacitated m-Ring-Star Problem. [Citation Graph (, )][DBLP]
    
    
27. 
    An Exact Method for the Minimum Caterpillar Spanning Problem. [Citation Graph (, )][DBLP]
    
    
28. 
    A Relax-and-Cut algorithm for the set partitioning problem. [Citation Graph (, )][DBLP]
    
    
29. 
    Acyclic orientations with path constraints [Citation Graph (, )][DBLP]