Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Cid C. de Souza
Cid Carvalho de Souza – C. Carvalho de Souza
Author information
- Institute of Computing, University of Campinas
2010 – today
- 2013
[c22]Davi C. Tozoni, Pedro J. de Rezende, Cid C. de Souza: The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm. SEA 2013: 320-336- 2012
- [j36]Breno Piva, Cid Carvalho de Souza: Polyhedral study of the maximum common induced subgraph problem. Annals OR 199(1): 77-102 (2012)
- [j35]Tony Minoru Tamura Lopes, Arnaldo Vieira Moura, Cid C. de Souza, André A. Ciré: Planning the operation of a large real-world oil pipeline. Computers & Chemical Engineering 46: 17-28 (2012)
- [j34]Laura Bahiense, Gordana Manic, Breno Piva, Cid C. de Souza: The maximum common edge subgraph problem: A polyhedral investigation. Discrete Applied Mathematics 160(18): 2523-2541 (2012)
- [j33]Edna Ayako Hoshino, Cid C. de Souza: A branch-and-cut-and-price approach for the capacitated m-ring-star problem. Discrete Applied Mathematics 160(18): 2728-2741 (2012)
- [j32]Guilherme Kunigami, Pedro J. de Rezende, Cid C. de Souza, Tallys H. Yunes: Generating optimal drawings of physically realizable symbol maps with integer programming. The Visual Computer 28(10): 1015-1026 (2012)
- [c21]Breno Piva, Cid C. de Souza: The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation. ISCO 2012: 36-47
- 2011
- [j31]Rosa M. V. Figueiredo, Martine Labbé, Cid C. de Souza: An exact approach to the problem of extracting an embedded network matrix. Computers & OR 38(11): 1483-1492 (2011)
- [j30]Luidi Simonetti, Yuri Frota, Cid C. de Souza: The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm. Discrete Applied Mathematics 159(16): 1901-1914 (2011)
- [j29]Luidi Simonetti, Fábio Protti, Yuri Frota, Cid C. de Souza: New branch-and-bound algorithms for k-cardinality tree problems. Electronic Notes in Discrete Mathematics 37: 27-32 (2011)
- [j28]Cid C. de Souza, Victor F. Cavalcante: Exact algorithms for the vertex separator problem in graphs. Networks 57(3): 212-230 (2011)
- [j27]Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza: A branch-and-price approach for the partition coloring problem. Oper. Res. Lett. 39(2): 132-137 (2011)
- [c20]Rafael G. Cano, Guilherme Kunigami, Cid C. de Souza, Pedro J. de Rezende: Effective drawing of proportional symbol maps using GRASP. CTW 2011: 97-100
- [c19]Guilherme Kunigami, Pedro Jussieu de Rezende, Cid C. de Souza, Tallys H. Yunes: Optimizing the Layout of Proportional Symbol Maps. ICCSA (3) 2011: 1-16
- [c18]Guilherme Kunigami, Pedro Jussieu de Rezende, Cid Carvalho de Souza, Tallys H. Yunes: Determining an Optimal Visualization of Physically Realizable Symbol Maps. SIBGRAPI 2011: 117-124
- [c17]Igor R. de Assis, Cid C. de Souza: Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs. SEA 2011: 304-314
- 2010
- [j26]Tony Minoru Tamura Lopes, André A. Ciré, Cid Carvalho de Souza, Arnaldo Vieira Moura: A hybrid model for a multiproduct pipeline planning and scheduling problem. Constraints 15(2): 151-189 (2010)
- [j25]Alexandre Salles da Cunha, Laura Bahiense, Abilio Lucena, Cid Carvalho de Souza: A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem. Electronic Notes in Discrete Mathematics 36: 623-630 (2010)
2000 – 2009
- 2009
- [j24]Gordana Manic, Laura Bahiense, Cid C. de Souza: A branch&cut algorithm for the maximum common edge subgraph problem. Electronic Notes in Discrete Mathematics 35: 47-52 (2009)
- [j23]Luidi Simonetti, Yuri Frota, Cid C. de Souza: Upper and lower bounding procedures for the minimum caterpillar spanning problem. Electronic Notes in Discrete Mathematics 35: 83-88 (2009)
- [j22]Edna Ayako Hoshino, Cid Carvalho de Souza: A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem. Electronic Notes in Discrete Mathematics 35: 103-108 (2009)
- [c16]Luidi Simonetti, Yuri Frota, Cid C. de Souza: An Exact Method for the Minimum Caterpillar Spanning Problem. CTW 2009: 48-51
- [c15]Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza: A Branch-and-Price Approach for the Partition Coloring Problem. CTW 2009: 187-190
- [c14]Marcelo C. Couto, Pedro Jussieu de Rezende, Cid C. de Souza: An IP solution to the art gallery problem. Symposium on Computational Geometry 2009: 88-89
- 2008
- [j21]Victor F. Cavalcante, Cid C. de Souza, Abilio Lucena: A Relax-and-Cut algorithm for the set partitioning problem. Computers & OR 35(6): 1963-1981 (2008)
- [j20]Rosa M. V. Figueiredo, Valmir C. Barbosa, Nelson Maculan, Cid C. de Souza: Acyclic Orientations with Path Constraints. RAIRO - Operations Research 42(4): 455-467 (2008)
- [c13]Edna Ayako Hoshino, Cid C. de Souza: Column Generation Algorithms for the Capacitated m-Ring-Star Problem. COCOON 2008: 631-641
- [c12]Gordana Manic, Laura Bahiense, Cid C. de Souza: On the Facial Structure of the Common Edge Subgraph polytope. CTW 2008: 62-65
- [c11]Victor F. Cavalcante, Cid C. de Souza: Exact Algorithms for the Vertex Separator Problem in Graphs. CTW 2008: 104-107
- [c10]Edna Ayako Hoshino, Cid C. de Souza: Column Generation Algorithms for the Capacitated m-Ring-Star Problem. CTW 2008: 158-161
- [c9]Arnaldo Vieira Moura, Cid C. de Souza, André A. Ciré, Tony Minoru Tamura Lopes: Planning and Scheduling the Operation of a Very Large Oil Pipeline Network. CP 2008: 36-51
- [c8]Arnaldo Vieira Moura, Cid C. de Souza, André A. Ciré, Tony Minoru Tamura Lopes: Heuristics and Constraint Programming Hybridizations for a Real Pipeline Planning and Scheduling Problem. CSE 2008: 455-462
- [c7]Marcelo C. Couto, Cid C. de Souza, Pedro Jussieu de Rezende: Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem. WEA 2008: 101-113
- 2007
- [c6]Victor F. Cavalcante, Cid C. de Souza: Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem. ESCAPE 2007: 471-482
- [c5]Marcelo C. Couto, Cid C. de Souza, Pedro Jussieu de Rezende: An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem. SIBGRAPI 2007: 87-94
- 2006
- [j19]Pablo E. Coll, Celso C. Ribeiro, Cid C. de Souza: Multiprocessor scheduling under precedence constraints: Polyhedral results. Discrete Applied Mathematics 154(5): 770-801 (2006)
- [j18]Maikol M. Rodrigues, Cid C. de Souza, Arnaldo Vieira Moura: Vehicle and crew scheduling for urban bus lines. European Journal of Operational Research 170(3): 844-862 (2006)
- [j17]Elder M. Macambira, Nelson Maculan, Cid C. de Souza: A column generation approach for SONET ring assignment. Networks 47(3): 157-171 (2006)
- 2005
- [j16]Cid C. de Souza, André M. Lima, Guido Araujo, Nahri Moreano: The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation. ACM Journal of Experimental Algorithmics 10 (2005)
- [j15]Egon Balas, Cid C. de Souza: The vertex separator problem: a polyhedral investigation. Math. Program. 103(3): 583-608 (2005)
- [j14]Cid C. de Souza, Egon Balas: The vertex separator problem: algorithms and computations. Math. Program. 103(3): 609-631 (2005)
- [j13]Nahri Moreano, Edson Borin, Cid C. de Souza, Guido Araujo: Efficient datapath merging for partially reconfigurable architectures. IEEE Trans. on CAD of Integrated Circuits and Systems 24(7): 969-980 (2005)
- [j12]Tallys H. Yunes, Arnaldo Vieira Moura, Cid C. de Souza: Hybrid Column Generation Approaches for Urban Transit Crew Management Problems. Transportation Science 39(2): 273-288 (2005)
- [c4]Romulo A. Pereira, Arnaldo Vieira Moura, Cid C. de Souza: Comparative Experiments with GRASP and Constraint Programming for the Oil Well Drilling Problem. WEA 2005: 328-340
- [i1]Rosa M. V. Figueiredo, Valmir C. Barbosa, Nelson Maculan, Cid C. de Souza: Acyclic orientations with path constraints. CoRR abs/cs/0510064 (2005)
- 2004
- [c3]Cid C. de Souza, André M. Lima, Nahri Moreano, Guido Araujo: The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation. WEA 2004: 545-558
- 2003
- [j11]Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza: Optimal rectangular partitions. Networks 41(1): 51-67 (2003)
- 2002
- [j10]Carlos Eduardo Ferreira, C. Carvalho de Souza, Yoshiko Wakabayashi: Rearrangement of DNA fragments: a branch-and-cut algorithm. Discrete Applied Mathematics 116(1-2): 161-177 (2002)
- 2001
- [j9]Cristina C. B. Cavalcante, C. Carvalho de Souza, Martin W. P. Savelsbergh, Y. Wang, Laurence A. Wolsey: Scheduling projects with labor constraints. Discrete Applied Mathematics 112(1-3): 27-52 (2001)
- 2000
- [j8]Susanne Heipcke, Yves Colombani, Cristina C. B. Cavalcante, Cid C. de Souza: Scheduling under Labour Resource Constraints. Constraints 5(4): 415-422 (2000)
- [j7]Elder Magalhães Macambira, Cid Carvalho de Souza: The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations. European Journal of Operational Research 123(2): 346-371 (2000)
- [j6]Cláudio Nogueira de Meneses, Cid C. de Souza: Exact Solutions of Rectangular Partitions via Integer Programming. Int. J. Comput. Geometry Appl. 10(5): 477-522 (2000)
- [c2]Tallys H. Yunes, Arnaldo Vieira Moura, Cid C. de Souza: A Hybrid Approach for Solving Large Scale Crew Scheduling Problems. PADL 2000: 293-307
- [c1]Tallys H. Yunes, Arnaldo Vieira Moura, Cid C. de Souza: Solving Very Large Crew Scheduling Problems to Optimality. SAC (1) 2000: 446-451
1990 – 1999
- 1999
- [j5]Nelson Maculan, Stella C. S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza: A new formulation for scheduling unrelated processor under precedence constraints. RAIRO - Operations Research 33(1): 87-92 (1999)
- 1998
- [j4]Carlos Eduardo Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey: The node capacitated graph partitioning problem: A computational study. Math. Program. 81: 229-256 (1998)
- 1996
- [j3]Carlos Eduardo Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey: Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Program. 74: 247-266 (1996)
- 1995
- [j2]Cid C. de Souza, M. Laurent: Some New Classes of Facets for the Equicut Polytope. Discrete Applied Mathematics 62(1-3): 167-191 (1995)
- 1993
- [j1]C. Carvalho de Souza, Celso C. Ribeiro: Heuristics for the Minimum Rectilinear Steiner Tree Problem: New Algorithms and a Computational Study. Discrete Applied Mathematics 45(3): 205-220 (1993)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-23 22:14 CEST by the dblp team