default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCid C. de Souza
Cid Carvalho de Souza – C. Carvalho de Souza
Person information
- affiliation: Institute of Computing, University of Campinas, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j67]Carlos Victor Dantas Araújo
, Cid Carvalho de Souza, Fábio Luiz Usberti:
Lagrangian relaxation for maximum service in multicast routing with QoS constraints. Int. Trans. Oper. Res. 31(1): 140-166 (2024)- [j66]Natanael Ramos, Rafael G. Cano, Pedro J. de Rezende, Cid C. de Souza:
Exact and heuristic solutions for the prize-collecting geometric enclosure problem. Int. Trans. Oper. Res. 31(4): 2093-2122 (2024) - 2023
- [j65]Cristiana L. Lara, Jochen Könemann, Yisu Nie, Cid C. de Souza:
Scalable timing-aware network design via lagrangian decomposition. Eur. J. Oper. Res. 309(1): 152-169 (2023) - [c39]Ana Paula dos Santos Dantas, Gabriel Bianchin de Oliveira, Hélio Pedrini, Cid C. de Souza, Zanoni Dias:
The Multi-attribute Fairer Cover Problem. BRACIS (1) 2023: 163-177 - [c38]Ana Paula dos Santos Dantas, Gabriel Bianchin de Oliveira, Daiane Mendes de Oliveira, Hélio Pedrini, Cid C. de Souza, Zanoni Dias:
Algorithmic Fairness Applied to the Multi-Label Classification Problem. VISIGRAPP (5: VISAPP) 2023: 737-744 - 2022
- [j64]Natanael Ramos, Pedro J. de Rezende, Cid C. de Souza:
Optimal area polygonization problems: Exact solutions through geometric duality. Comput. Oper. Res. 145: 105842 (2022) - [j63]Ana Paula dos Santos Dantas, Cid C. de Souza, Zanoni Dias:
A heuristic for the convex recoloring problem in graphs. Int. Trans. Oper. Res. 29(3): 1454-1478 (2022) - [j62]Natanael Ramos, Raí C. de Jesus, Pedro J. de Rezende, Cid C. de Souza, Fábio Luiz Usberti:
Triangle-Based Heuristics for Area Optimal Polygonizations. ACM J. Exp. Algorithmics 27: 2.1:1-2.1:25 (2022) - [i6]Pedro Olímpio Pinheiro, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Cid C. de Souza, Zanoni Dias:
Algorithms for the Maximum Eulerian Cycle Decomposition Problem. CoRR abs/2203.05446 (2022) - 2021
- [j61]Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza:
Solving the minimum convex partition of point sets with integer programming. Comput. Geom. 99: 101794 (2021) - [c37]Allan Sapucaia, André A. Ciré, Pedro J. de Rezende, Cid C. de Souza:
Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips. CCCG 2021: 185-194 - [c36]Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza:
Solving the Coarseness Problem by ILP Using Column Generation. ICCSA (5) 2021: 30-45 - [c35]Felipe de Carvalho Pereira, Pedro J. de Rezende, Cid C. de Souza:
Effective Heuristics for the Perfect Awareness Problem. LAGOS 2021: 489-498 - 2020
- [j60]Natanael Ramos, Cid Carvalho de Souza, Pedro Jussieu de Rezende:
A matheuristic for the firefighter problem on graphs. Int. Trans. Oper. Res. 27(2): 739-766 (2020) - [c34]Pedro Olímpio Pinheiro, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Cid Carvalho de Souza, Zanoni Dias:
Heuristics for Breakpoint Graph Decomposition with Applications in Genome Rearrangement Problems. BSB 2020: 129-140 - [i5]Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza:
Solving the Minimum Convex Partition of Point Sets with Integer Programming. CoRR abs/2012.03381 (2020)
2010 – 2019
- 2019
- [j59]Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza:
Solving the geometric firefighter routing problem via integer programming. Eur. J. Oper. Res. 274(3): 1090-1101 (2019) - [j58]Celso C. Ribeiro, Tiago de A. Santos, Cid C. de Souza:
Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax-and-fix heuristic. Int. Trans. Oper. Res. 26(4): 1339-1364 (2019) - [j57]Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende:
Solving dynamic labeling problems to optimality using solution space reductions. Theor. Comput. Sci. 789: 77-92 (2019) - [c33]Allan S. Barboza, Cid C. de Souza, Pedro J. de Rezende:
Minimum Convex Partition of Point Sets. CIAC 2019: 25-37 - [c32]Ana Paula dos Santos Dantas, Cid Carvalho de Souza, Zanoni Dias:
A GRASP for the Convex Recoloring Problem in Graphs. LAGOS 2019: 379-391 - 2018
- [j56]Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza:
Finding exact solutions for the Geometric Firefighter Problem in practice. Comput. Oper. Res. 97: 72-83 (2018) - [c31]Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende:
Optimal Solutions for a Geometric Knapsack Problem using Integer Programming. CCCG 2018: 265-271 - 2017
- [j55]Breno Piva, Cid C. de Souza:
Minimum stabbing rectangular partitions of rectilinear polygons. Comput. Oper. Res. 80: 184-197 (2017) - [c30]Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende:
Fast Optimal Labelings for Rotating Maps. WALCOM 2017: 161-173 - 2016
- [j54]Lucas de Oliveira, Cid C. de Souza, Tallys H. Yunes:
Lower bounds for large traveling umpire instances: New valid inequalities and a branch-and-cut algorithm. Comput. Oper. Res. 72: 147-159 (2016) - [j53]Agostinho Agra, Mahdi Doostmohammadi, Cid C. de Souza:
Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph. Discret. Optim. 21: 42-70 (2016) - [j52]Davi C. Tozoni, Pedro J. de Rezende, Cid C. de Souza:
Algorithm 966: A Practical Iterative Algorithm for the Art Gallery Problem Using Integer Linear Programming. ACM Trans. Math. Softw. 43(2): 16:1-16:27 (2016) - [c29]Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza:
Exact Solutions for the Geometric Firefighter Problem. CCCG 2016: 223-229 - [p1]Pedro J. de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni:
Engineering Art Galleries. Algorithm Engineering 2016: 379-417 - 2015
- [j51]Bruno E. Crepaldi, Pedro J. de Rezende, Cid C. de Souza:
Solving the natural wireless localization problem to optimality efficiently. Comput. Geom. 48(5): 370-379 (2015) - [j50]Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende, Tallys H. Yunes:
Arc-based integer programming formulations for three variants of proportional symbol maps. Discret. Optim. 18: 87-110 (2015) - [j49]Breno Piva, Cid C. de Souza:
Partitions of Rectilinear Polygons with Minimum Stabbing Number. Electron. Notes Discret. Math. 50: 267-273 (2015) - [j48]Andrei Braga, Cid C. de Souza, Orlando Lee:
The Eternal Dominating Set problem for proper interval graphs. Inf. Process. Lett. 115(6-8): 582-587 (2015) - [j47]Lucas de Oliveira, Cid C. de Souza, Tallys H. Yunes:
On the complexity of the traveling umpire problem. Theor. Comput. Sci. 562: 101-111 (2015) - [c28]Aléx F. Brandt, Miguel F. A. de Gaiowski, Pedro J. de Rezende, Cid C. de Souza:
Computing Minimum Dilation Spanning Trees in Geometric Graphs. COCOON 2015: 297-309 - [i4]Andrei Braga, Cid C. de Souza, Orlando Lee:
Computing Bounds for Eternal Domination. CTW 2015: 177-180 - [i3]Breno Piva, Cid C. de Souza:
Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number. CoRR abs/1506.03865 (2015) - 2014
- [j46]Lucas de Oliveira, Cid C. de Souza, Tallys H. Yunes:
Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic. Eur. J. Oper. Res. 236(2): 592-600 (2014) - [j45]Guilherme Kunigami, Pedro J. de Rezende, Cid C. de Souza, Tallys H. Yunes:
Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation. INFORMS J. Comput. 26(2): 199-207 (2014) - [j44]Breno Piva, Cid C. de Souza, Yuri Frota, Luidi Simonetti:
Integer programming approaches for minimum stabbing problems. RAIRO Oper. Res. 48(2): 211-233 (2014) - [c27]Aléx F. Brandt, Miguel M. Gaiowski, Cid C. de Souza, Pedro J. de Rezende:
Minimum Dilation Triangulation: Reaching Optimality Efficiently. CCCG 2014 - [c26]Eduardo T. Bogue, Cid C. de Souza, Eduardo C. Xavier, Alexandre S. Freire:
An Integer Programming Formulation for the Maximum k-Subset Intersection Problem. ISCO 2014: 87-99 - [c25]Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza:
An Exact Algorithm for the Discrete Chromatic Art Gallery Problem. SEA 2014: 59-73 - [i2]Pedro Jussieu de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni:
Engineering Art Galleries. CoRR abs/1410.8720 (2014) - 2013
- [j43]Rafael G. Cano, Guilherme Kunigami, Cid C. de Souza, Pedro J. de Rezende:
A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps. Comput. Oper. Res. 40(5): 1435-1447 (2013) - [j42]Agostinho Agra, Mahdi Doostmohammadi, Cid Carvalho de Souza:
Intersecting a simple mixed integer set with a vertex packing set. Electron. Notes Discret. Math. 41: 327-334 (2013) - [j41]Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende, Tallys H. Yunes:
Arc-based integer programming formulations for three variants of proportional symbol maps. Electron. Notes Discret. Math. 44: 251-256 (2013) - [c24]Bruno E. Crepaldi, Pedro J. de Rezende, Cid C. de Souza:
An Efficient Exact Algorithm for the Natural Wireless Localization Problem. CCCG 2013 - [c23]Dorit Borrmann, Pedro J. de Rezende, Cid C. de Souza, Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Andreas Nüchter, Christiane Schmidt, Davi C. Tozoni:
Point guards and point clouds: solving general art gallery problems. SoCG 2013: 347-348 - [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
- [j40]Breno Piva, Cid Carvalho de Souza:
Polyhedral study of the maximum common induced subgraph problem. Ann. Oper. Res. 199(1): 77-102 (2012) - [j39]Tony Minoru Tamura Lopes, Arnaldo Vieira Moura, Cid C. de Souza, André A. Ciré:
Planning the operation of a large real-world oil pipeline. Comput. Chem. Eng. 46: 17-28 (2012) - [j38]Laura Bahiense, Gordana Manic, Breno Piva, Cid C. de Souza:
The maximum common edge subgraph problem: A polyhedral investigation. Discret. Appl. Math. 160(18): 2523-2541 (2012) - [j37]Edna Ayako Hoshino, Cid C. de Souza:
A branch-and-cut-and-price approach for the capacitated m-ring-star problem. Discret. Appl. Math. 160(18): 2728-2741 (2012) - [j36]Guilherme Kunigami, Pedro J. de Rezende, Cid C. de Souza, Tallys H. Yunes:
Generating optimal drawings of physically realizable symbol maps with integer programming. Vis. Comput. 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
- [j35]Rosa M. V. Figueiredo, Martine Labbé, Cid C. de Souza:
An exact approach to the problem of extracting an embedded network matrix. Comput. Oper. Res. 38(11): 1483-1492 (2011) - [j34]Luidi Simonetti, Yuri Frota, Cid C. de Souza:
The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm. Discret. Appl. Math. 159(16): 1901-1914 (2011) - [j33]Luidi Simonetti, Fábio Protti, Yuri Frota, Cid C. de Souza:
New branch-and-bound algorithms for k-cardinality tree problems. Electron. Notes Discret. Math. 37: 27-32 (2011) - [j32]Marcelo C. Couto, Pedro J. de Rezende, Cid C. de Souza:
An exact algorithm for minimizing vertex guards on art galleries. Int. Trans. Oper. Res. 18(4): 425-448 (2011) - [j31]Cid C. de Souza, Victor F. Cavalcante:
Exact algorithms for the vertex separator problem in graphs. Networks 57(3): 212-230 (2011) - [j30]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
- [j29]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 An Int. J. 15(2): 151-189 (2010) - [j28]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. Electron. Notes Discret. Math. 36: 623-630 (2010)
2000 – 2009
- 2009
- [j27]Gordana Manic, Laura Bahiense, Cid C. de Souza:
A branch&cut algorithm for the maximum common edge subgraph problem. Electron. Notes Discret. Math. 35: 47-52 (2009) - [j26]Luidi Simonetti, Yuri Frota, Cid C. de Souza:
Upper and lower bounding procedures for the minimum caterpillar spanning problem. Electron. Notes Discret. Math. 35: 83-88 (2009) - [j25]Edna Ayako Hoshino, Cid Carvalho de Souza:
A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem. Electron. Notes Discret. Math. 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. SCG 2009: 88-89 - 2008
- [j24]Victor F. Cavalcante, Cid C. de Souza, Abilio Lucena:
A Relax-and-Cut algorithm for the set partitioning problem. Comput. Oper. Res. 35(6): 1963-1981 (2008) - [j23]Arnaldo Vieira Moura, Romulo A. Pereira, Cid C. de Souza:
Scheduling activities at oil wells with resource displacement. Int. Trans. Oper. Res. 15(6): 659-683 (2008) - [j22]Rosa M. V. Figueiredo, Valmir Carneiro Barbosa, Nelson Maculan, Cid C. de Souza:
Acyclic Orientations with Path Constraints. RAIRO Oper. Res. 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
- [j21]Pablo E. Coll, Celso C. Ribeiro, Cid C. de Souza:
Multiprocessor scheduling under precedence constraints: Polyhedral results. Discret. Appl. Math. 154(5): 770-801 (2006) - [j20]Maikol M. Rodrigues, Cid C. de Souza, Arnaldo Vieira Moura:
Vehicle and crew scheduling for urban bus lines. Eur. J. Oper. Res. 170(3): 844-862 (2006) - [j19]Elder M. Macambira, Nelson Maculan, Cid C. de Souza:
A column generation approach for SONET ring assignment. Networks 47(3): 157-171 (2006) - 2005
- [j18]Elder M. Macambira, Nelson Maculan, Cid C. de Souza:
A note on characterizing canonical cuts using geometry. Int. Trans. Oper. Res. 12(6): 581-593 (2005) - [j17]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 J. Exp. Algorithmics 10 (2005) - [j16]Egon Balas, Cid C. de Souza:
The vertex separator problem: a polyhedral investigation. Math. Program. 103(3): 583-608 (2005) - [j15]Cid C. de Souza, Egon Balas:
The vertex separator problem: algorithms and computations. Math. Program. 103(3): 609-631 (2005) - [j14]Nahri Moreano, Edson Borin, Cid C. de Souza, Guido Araujo:
Efficient datapath merging for partially reconfigurable architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 24(7): 969-980 (2005) - [j13]Tallys H. Yunes, Arnaldo Vieira Moura, Cid C. de Souza:
Hybrid Column Generation Approaches for Urban Transit Crew Management Problems. Transp. Sci. 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 Carneiro 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
- [j12]Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza:
Optimal rectangular partitions. Networks 41(1): 51-67 (2003) - 2002
- [j11]Carlos Eduardo Ferreira, C. Carvalho de Souza, Yoshiko Wakabayashi:
Rearrangement of DNA fragments: a branch-and-cut algorithm. Discret. Appl. Math. 116(1-2): 161-177 (2002) - 2001
- [j10]Cristina C. B. Cavalcante, C. Carvalho de Souza, Martin W. P. Savelsbergh, Y. Wang, Laurence A. Wolsey:
Scheduling projects with labor constraints. Discret. Appl. Math. 112(1-3): 27-52 (2001) - 2000
- [j9]Susanne Heipcke, Yves Colombani, Cristina C. B. Cavalcante, Cid C. de Souza:
Scheduling under Labour Resource Constraints. Constraints An Int. J. 5(4): 415-422 (2000) - [j8]Elder Magalhães Macambira, Cid Carvalho de Souza:
The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations. Eur. J. Oper. Res. 123(2): 346-371 (2000) - [j7]Cláudio Nogueira de Meneses, Cid C. de Souza:
Exact Solutions of Rectangular Partitions via Integer Programming. Int. J. Comput. Geom. 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
- [j6]Nelson Maculan, Stella C. S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza:
A new formulation for scheduling unrelated processor under precedence constraints. RAIRO Oper. Res. 33(1): 87-92 (1999) - 1998
- [j5]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) - [j4]José Claudio Geromel, Cid C. de Souza, Robert E. Skelton:
Static output feedback controllers: stability and convexity. IEEE Trans. Autom. Control. 43(1): 120-125 (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, Monique Laurent:
Some New Classes of Facets for the Equicut Polytope. Discret. Appl. Math. 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. Discret. Appl. Math. 45(3): 205-220 (1993)
Coauthor Index
Pedro Jussieu de Rezende
aka: Pedro J. de Rezende
aka: Pedro J. de Rezende
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-25 00:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
