Cid C. de Souza

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 25

Top Topics

Integer Program

Valid Inequalities

Top Venues

Comput. Oper. Res.

Int. Trans. Oper. Res.

Publications

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) (2024)
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) (2023)
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)
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)
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) (2022)
Natanael Ramos, Raí C. de Jesus, Pedro J. de Rezende, Cid C. de Souza, Fabio Luiz Usberti
Triangle-Based Heuristics for Area Optimal Polygonizations. ACM J. Exp. Algorithmics 27 (2022)
Natanael Ramos, Pedro J. de Rezende, Cid C. de Souza
Optimal area polygonization problems: Exact solutions through geometric duality. Comput. Oper. Res. 145 (2022)
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 (2022)
Felipe de C. Pereira, Pedro J. de Rezende, Cid C. de Souza
Effective Heuristics for the Perfect Awareness Problem. LAGOS (2021)
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)
Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza
Solving the minimum convex partition of point sets with integer programming. Comput. Geom. 99 (2021)
Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza
Solving the Coarseness Problem by ILP Using Column Generation. ICCSA (5) (2021)
Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza
Solving the Minimum Convex Partition of Point Sets with Integer Programming. CoRR (2020)
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) (2019)
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) (2019)
Allan S. Barboza, Cid C. de Souza, Pedro J. de Rezende
Minimum Convex Partition of Point Sets. CIAC (2019)
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 (2019)
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 (2018)
Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende
Optimal Solutions for a Geometric Knapsack Problem using Integer Programming. CCCG (2018)
Breno Piva, Cid C. de Souza
Minimum stabbing rectangular partitions of rectilinear polygons. Comput. Oper. Res. 80 (2017)
Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende
Fast Optimal Labelings for Rotating Maps. WALCOM (2017)
Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza
Exact Solutions for the Geometric Firefighter Problem. CCCG (2016)
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 (2016)
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) (2016)
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 (2016)
Lucas de Oliveira, Cid C. de Souza, Tallys H. Yunes
On the complexity of the traveling umpire problem. Theor. Comput. Sci. 562 (2015)
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 (2015)
Andrei Braga, Cid C. de Souza, Orlando Lee
The Eternal Dominating Set problem for proper interval graphs. Inf. Process. Lett. 115 (6-8) (2015)
Breno Piva, Cid C. de Souza
Partitions of Rectilinear Polygons with Minimum Stabbing Number. Electron. Notes Discret. Math. 50 (2015)
Andrei Braga, Cid C. de Souza, Orlando Lee
Computing Bounds for Eternal Domination. CTW (2015)
Breno Piva, Cid C. de Souza
Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number. CoRR (2015)
Bruno E. Crepaldi, Pedro J. de Rezende, Cid C. de Souza
Solving the natural wireless localization problem to optimality efficiently. Comput. Geom. 48 (5) (2015)
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)
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) (2014)
Breno Piva, Cid C. de Souza, Yuri Frota, Luidi Simonetti
Integer programming approaches for minimum stabbing problems. RAIRO Oper. Res. 48 (2) (2014)
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)
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)
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) (2014)
Pedro Jussieu de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni
Engineering Art Galleries. CoRR (2014)
Aléx F. Brandt, Miguel M. Gaiowski, Cid C. de Souza, Pedro J. de Rezende
Minimum Dilation Triangulation: Reaching Optimality Efficiently. CCCG (2014)
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) (2013)
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)
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 (2013)
Bruno E. Crepaldi, Pedro J. de Rezende, Cid C. de Souza
An Efficient Exact Algorithm for the Natural Wireless Localization Problem. CCCG (2013)
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)
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) (2012)
Laura Bahiense, Gordana Manic, Breno Piva, Cid C. de Souza
The maximum common edge subgraph problem: A polyhedral investigation. Discret. Appl. Math. 160 (18) (2012)
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) (2012)
Breno Piva, Cid C. de Souza
The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation. ISCO (2012)
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 (2012)
Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza
A branch-and-price approach for the partition coloring problem. Oper. Res. Lett. 39 (2) (2011)
Cid C. de Souza, Victor F. Cavalcante
Exact algorithms for the vertex separator problem in graphs. Networks 57 (3) (2011)
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) (2011)
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) (2011)
Guilherme Kunigami, Pedro Jussieu de Rezende, Cid C. de Souza, Tallys H. Yunes
Optimizing the Layout of Proportional Symbol Maps. ICCSA (3) (2011)
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 (2011)
Rafael G. Cano, Guilherme Kunigami, Cid C. de Souza, Pedro J. de Rezende
Effective drawing of proportional symbol maps using GRASP. CTW (2011)
Igor R. de Assis, Cid C. de Souza
Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs. SEA (2011)
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) (2011)
Luidi Simonetti, Yuri Frota, Cid C. de Souza
An Exact Method for the Minimum Caterpillar Spanning Problem. CTW (2009)
Luidi Simonetti, Yuri Frota, Cid C. de Souza
Upper and lower bounding procedures for the minimum caterpillar spanning problem. Electron. Notes Discret. Math. 35 (2009)
Gordana Manic, Laura Bahiense, Cid C. de Souza
A branch&cut algorithm for the maximum common edge subgraph problem. Electron. Notes Discret. Math. 35 (2009)
Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza
A Branch-and-Price Approach for the Partition Coloring Problem. CTW (2009)
Marcelo C. Couto, Pedro Jussieu de Rezende, Cid C. de Souza
An IP solution to the art gallery problem. SCG (2009)
Victor F. Cavalcante, Cid C. de Souza, Abilio Lucena
A Relax-and-Cut algorithm for the set partitioning problem. Comput. Oper. Res. 35 (6) (2008)
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)
Edna Ayako Hoshino, Cid C. de Souza
Column Generation Algorithms for the Capacitated m-Ring-Star Problem. COCOON (2008)
Victor F. Cavalcante, Cid C. de Souza
Exact Algorithms for the Vertex Separator Problem in Graphs. CTW (2008)
Gordana Manic, Laura Bahiense, Cid C. de Souza
On the Facial Structure of the Common Edge Subgraph polytope. CTW (2008)
Edna Ayako Hoshino, Cid C. de Souza
-Ring-Star Problem. CTW (2008)
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)
Arnaldo Vieira Moura, Romulo A. Pereira, Cid C. de Souza
Scheduling activities at oil wells with resource displacement. Int. Trans. Oper. Res. 15 (6) (2008)
Rosa M. V. Figueiredo, Valmir Carneiro Barbosa, Nelson Maculan, Cid C. de Souza
Acyclic Orientations with Path Constraints. RAIRO Oper. Res. 42 (4) (2008)
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)
Marcelo C. Couto, Cid C. de Souza, Pedro Jussieu de Rezende
An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem. SIBGRAPI (2007)
Victor F. Cavalcante, Cid C. de Souza
Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem. ESCAPE (2007)
Maikol M. Rodrigues, Cid C. de Souza, Arnaldo Vieira Moura
Vehicle and crew scheduling for urban bus lines. Eur. J. Oper. Res. 170 (3) (2006)
Elder M. Macambira, Nelson Maculan, Cid C. de Souza
A column generation approach for SONET ring assignment. Networks 47 (3) (2006)
Pablo E. Coll, Celso C. Ribeiro, Cid C. de Souza
Multiprocessor scheduling under precedence constraints: Polyhedral results. Discret. Appl. Math. 154 (5) (2006)
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) (2005)
Cid C. de Souza, Egon Balas
The vertex separator problem: algorithms and computations. Math. Program. 103 (3) (2005)
Rosa M. V. Figueiredo, Valmir Carneiro Barbosa, Nelson Maculan, Cid C. de Souza
Acyclic orientations with path constraints CoRR (2005)
Egon Balas, Cid C. de Souza
The vertex separator problem: a polyhedral investigation. Math. Program. 103 (3) (2005)
Elder M. Macambira, Nelson Maculan, Cid C. de Souza
A note on characterizing canonical cuts using geometry. Int. Trans. Oper. Res. 12 (6) (2005)
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)
Tallys H. Yunes, Arnaldo Vieira Moura, Cid C. de Souza
Hybrid Column Generation Approaches for Urban Transit Crew Management Problems. Transp. Sci. 39 (2) (2005)
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)
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)
Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza
Optimal rectangular partitions. Networks 41 (1) (2003)
Susanne Heipcke, Yves Colombani, Cristina C. B. Cavalcante, Cid C. de Souza
Scheduling under Labour Resource Constraints. Constraints An Int. J. 5 (4) (2000)
Tallys H. Yunes, Arnaldo Vieira Moura, Cid C. de Souza
A Hybrid Approach for Solving Large Scale Crew Scheduling Problems. PADL (2000)
Tallys H. Yunes, Arnaldo Vieira Moura, Cid C. de Souza
Solving Very Large Crew Scheduling Problems to Optimality. SAC (1) (2000)
Cláudio Nogueira de Meneses, Cid C. de Souza
Exact Solutions of Rectangular Partitions via Integer Programming. Int. J. Comput. Geom. Appl. 10 (5) (2000)
José Claudio Geromel, Cid C. de Souza, Robert E. Skelton
Static output feedback controllers: stability and convexity. IEEE Trans. Autom. Control. 43 (1) (1998)
Cid C. de Souza, Monique Laurent
Some New Classes of Facets for the Equicut Polytope. Discret. Appl. Math. 62 (1-3) (1995)