Cid C. de Souza

According to our database, Cid C. de Souza authored at least 107 papers between 1993 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Exact and heuristic solutions for the prize-collecting geometric enclosure problem.

Natanael Ramos, Rafael G. Cano, Pedro J. de Rezende, Cid C. de Souza

Int. Trans. Oper. Res., July, 2024

Lagrangian relaxation for maximum service in multicast routing with QoS constraints.

Carlos Victor Dantas Araújo, Cid Carvalho de Souza, Fábio Luiz Usberti

Int. Trans. Oper. Res., January, 2024

2023

Scalable timing-aware network design via lagrangian decomposition.

Cristiana L. Lara, Jochen Könemann, Yisu Nie, Cid C. de Souza

Eur. J. Oper. Res., August, 2023

Algorithmic Fairness Applied to the Multi-Label Classification Problem.

Ana Paula dos Santos Dantas, Gabriel Bianchin de Oliveira, Daiane Mendes de Oliveira, Hélio Pedrini, Cid C. de Souza, Zanoni Dias

Proceedings of the 18th International Joint Conference on Computer Vision, 2023

The Multi-attribute Fairer Cover Problem.

Ana Paula dos Santos Dantas, Gabriel Bianchin de Oliveira, Hélio Pedrini, Cid C. de Souza, Zanoni Dias

Proceedings of the Intelligent Systems - 12th Brazilian Conference, 2023

2022

Triangle-Based Heuristics for Area Optimal Polygonizations.

Natanael Ramos, Raí C. de Jesus, Pedro J. de Rezende, Cid C. de Souza, Fábio Luiz Usberti

ACM J. Exp. Algorithmics, 2022

A heuristic for the convex recoloring problem in graphs.

Ana Paula dos Santos Dantas, Cid C. de Souza, Zanoni Dias

Int. Trans. Oper. Res., 2022

Algorithms for the Maximum Eulerian Cycle Decomposition Problem.

Pedro Olímpio Pinheiro, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Cid C. de Souza, Zanoni Dias

CoRR, 2022

Optimal area polygonization problems: Exact solutions through geometric duality.

Natanael Ramos, Pedro J. de Rezende, Cid C. de Souza

Comput. Oper. Res., 2022

2021

Solving the minimum convex partition of point sets with integer programming.

Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza

Comput. Geom., 2021

Effective Heuristics for the Perfect Awareness Problem.

Felipe de C. Pereira, Pedro J. de Rezende, Cid C. de Souza

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Solving the Coarseness Problem by ILP Using Column Generation.

Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza

Proceedings of the Computational Science and Its Applications - ICCSA 2021, 2021

Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips.

Allan Sapucaia, André A. Ciré, Pedro J. de Rezende, Cid C. de Souza

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

A matheuristic for the firefighter problem on graphs.

Natanael Ramos, Cid Carvalho de Souza, Pedro Jussieu de Rezende

Int. Trans. Oper. Res., 2020

Heuristics for Breakpoint Graph Decomposition with Applications in Genome Rearrangement Problems.

Pedro Olímpio Pinheiro, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Cid Carvalho de Souza, Zanoni Dias

Proceedings of the Advances in Bioinformatics and Computational Biology, 2020

2019

Solving dynamic labeling problems to optimality using solution space reductions.

Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende

Theor. Comput. Sci., 2019

Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax-and-fix heuristic.

Celso C. Ribeiro, Tiago de A. Santos, Cid C. de Souza

Int. Trans. Oper. Res., 2019

Solving the geometric firefighter routing problem via integer programming.

Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza

Eur. J. Oper. Res., 2019

A GRASP for the Convex Recoloring Problem in Graphs.

Ana Paula dos Santos Dantas, Cid Carvalho de Souza, Zanoni Dias

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Minimum Convex Partition of Point Sets.

Allan S. Barboza, Cid C. de Souza, Pedro J. de Rezende

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Finding exact solutions for the Geometric Firefighter Problem in practice.

Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza

Comput. Oper. Res., 2018

Optimal Solutions for a Geometric Knapsack Problem using Integer Programming.

Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Minimum stabbing rectangular partitions of rectilinear polygons.

Breno Piva, Cid C. de Souza

Comput. Oper. Res., 2017

Fast Optimal Labelings for Rotating Maps.

Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende

Proceedings of the WALCOM: Algorithms and Computation, 2017

2016

Engineering Art Galleries.

Pedro J. de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni

Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Algorithm 966: A Practical Iterative Algorithm for the Art Gallery Problem Using Integer Linear Programming.

Davi C. Tozoni, Pedro J. de Rezende, Cid C. de Souza

ACM Trans. Math. Softw., 2016

Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph.

Agostinho Agra, Mahdi Doostmohammadi, Cid C. de Souza

Discret. Optim., 2016

Lower bounds for large traveling umpire instances: New valid inequalities and a branch-and-cut algorithm.

Lucas de Oliveira, Cid C. de Souza, Tallys H. Yunes

Comput. Oper. Res., 2016

Exact Solutions for the Geometric Firefighter Problem.

Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

On the complexity of the traveling umpire problem.

Lucas de Oliveira, Cid C. de Souza, Tallys H. Yunes

Theor. Comput. Sci., 2015

The Eternal Dominating Set problem for proper interval graphs.

Andrei Braga, Cid C. de Souza, Orlando Lee

Inf. Process. Lett., 2015

Partitions of Rectilinear Polygons with Minimum Stabbing Number.

Breno Piva, Cid C. de Souza

Electron. Notes Discret. Math., 2015

Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number.

Breno Piva, Cid C. de Souza

CoRR, 2015

Solving the natural wireless localization problem to optimality efficiently.

Bruno E. Crepaldi, Pedro J. de Rezende, Cid C. de Souza

Comput. Geom., 2015

Computing Bounds for Eternal Domination.

Andrei Braga, Cid C. de Souza, Orlando Lee

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Computing Minimum Dilation Spanning Trees in Geometric Graphs.

Aléx F. Brandt, Miguel F. A. de Gaiowski, Pedro J. de Rezende, Cid C. de Souza

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Integer programming approaches for minimum stabbing problems.

Breno Piva, Cid C. de Souza, Yuri Frota, Luidi Simonetti

RAIRO Oper. Res., 2014

Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation.

Guilherme Kunigami, Pedro J. de Rezende, Cid C. de Souza, Tallys H. Yunes

INFORMS J. Comput., 2014

Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic.

Lucas de Oliveira, Cid C. de Souza, Tallys H. Yunes

Eur. J. Oper. Res., 2014

Engineering Art Galleries.

Pedro Jussieu de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni

CoRR, 2014

An Exact Algorithm for the Discrete Chromatic Art Gallery Problem.

Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

An Integer Programming Formulation for the Maximum k-Subset Intersection Problem.

Eduardo T. Bogue, Cid C. de Souza, Eduardo C. Xavier, Alexandre S. Freire

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Minimum Dilation Triangulation: Reaching Optimality Efficiently.

Aléx F. Brandt, Miguel M. Gaiowski, Cid C. de Souza, Pedro J. de Rezende

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Arc-based integer programming formulations for three variants of proportional symbol maps.

Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende, Tallys H. Yunes

Electron. Notes Discret. Math., 2013

Intersecting a simple mixed integer set with a vertex packing set.

Agostinho Agra, Mahdi Doostmohammadi, Cid Carvalho de Souza

Electron. Notes Discret. Math., 2013

A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps.

Rafael G. Cano, Guilherme Kunigami, Cid C. de Souza, Pedro J. de Rezende

Comput. Oper. Res., 2013

The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm.

Davi C. Tozoni, Pedro J. de Rezende, Cid C. de Souza

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Point guards and point clouds: solving general art gallery problems.

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

Proceedings of the Symposium on Computational Geometry 2013, 2013

An Efficient Exact Algorithm for the Natural Wireless Localization Problem.

Bruno E. Crepaldi, Pedro J. de Rezende, Cid C. de Souza

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Generating optimal drawings of physically realizable symbol maps with integer programming.

Guilherme Kunigami, Pedro J. de Rezende, Cid C. de Souza, Tallys H. Yunes

Vis. Comput., 2012

The maximum common edge subgraph problem: A polyhedral investigation.

Laura Bahiense, Gordana Manic, Breno Piva, Cid C. de Souza

Discret. Appl. Math., 2012

Planning the operation of a large real-world oil pipeline.

Tony Minoru Tamura Lopes, Arnaldo Vieira Moura, Cid C. de Souza, André A. Ciré

Comput. Chem. Eng., 2012

Polyhedral study of the maximum common induced subgraph problem.

Breno Piva, Cid Carvalho de Souza

Ann. Oper. Res., 2012

The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation.

Breno Piva, Cid C. de Souza

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

A branch-and-price approach for the partition coloring problem.

Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza

Oper. Res. Lett., 2011

Exact algorithms for the vertex separator problem in graphs.

Cid C. de Souza, Victor F. Cavalcante

Networks, 2011

An exact algorithm for minimizing vertex guards on art galleries.

Marcelo C. Couto, Pedro J. de Rezende, Cid C. de Souza

Int. Trans. Oper. Res., 2011

New branch-and-bound algorithms for k-cardinality tree problems.

Luidi Simonetti, Fábio Protti, Yuri Frota, Cid C. de Souza

Electron. Notes Discret. Math., 2011

The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm.

Luidi Simonetti, Yuri Frota, Cid C. de Souza

Discret. Appl. Math., 2011

An exact approach to the problem of extracting an embedded network matrix.

Rosa M. V. Figueiredo, Martine Labbé, Cid C. de Souza

Comput. Oper. Res., 2011

Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs.

Igor R. de Assis, Cid C. de Souza

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Determining an Optimal Visualization of Physically Realizable Symbol Maps.

Guilherme Kunigami, Pedro Jussieu de Rezende, Cid Carvalho de Souza, Tallys H. Yunes

Proceedings of the 24th SIBGRAPI Conference on Graphics, 2011

Optimizing the Layout of Proportional Symbol Maps.

Guilherme Kunigami, Pedro Jussieu de Rezende, Cid C. de Souza, Tallys H. Yunes

Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Effective drawing of proportional symbol maps using GRASP.

Rafael G. Cano, Guilherme Kunigami, Cid C. de Souza, Pedro J. de Rezende

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem.

Alexandre Salles da Cunha, Laura Bahiense, Abilio Lucena, Cid Carvalho de Souza

Electron. Notes Discret. Math., 2010

A hybrid model for a multiproduct pipeline planning and scheduling problem.

Tony Minoru Tamura Lopes, André A. Ciré, Cid Carvalho de Souza, Arnaldo Vieira Moura

Constraints An Int. J., 2010

2009

Upper and lower bounding procedures for the minimum caterpillar spanning problem.

Luidi Simonetti, Yuri Frota, Cid C. de Souza

Electron. Notes Discret. Math., 2009

A branch&cut algorithm for the maximum common edge subgraph problem.

Gordana Manic, Laura Bahiense, Cid C. de Souza

Electron. Notes Discret. Math., 2009

A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem.

Edna Ayako Hoshino, Cid Carvalho de Souza

Electron. Notes Discret. Math., 2009

An IP solution to the art gallery problem.

Marcelo C. Couto, Pedro Jussieu de Rezende, Cid C. de Souza

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

An Exact Method for the Minimum Caterpillar Spanning Problem.

Luidi Simonetti, Yuri Frota, Cid C. de Souza

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Acyclic Orientations with Path Constraints.

Rosa M. V. Figueiredo, Valmir Carneiro Barbosa, Nelson Maculan, Cid C. de Souza

RAIRO Oper. Res., 2008

Scheduling activities at oil wells with resource displacement.

Arnaldo Vieira Moura, Romulo A. Pereira, Cid C. de Souza

Int. Trans. Oper. Res., 2008

A Relax-and-Cut algorithm for the set partitioning problem.

Victor F. Cavalcante, Cid C. de Souza, Abilio Lucena

Comput. Oper. Res., 2008

Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem.

Marcelo C. Couto, Cid C. de Souza, Pedro Jussieu de Rezende

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Heuristics and Constraint Programming Hybridizations for a Real Pipeline Planning and Scheduling Problem.

Arnaldo Vieira Moura, Cid C. de Souza, André A. Ciré, Tony Minoru Tamura Lopes

Proceedings of the 11th IEEE International Conference on Computational Science and Engineering, 2008

Planning and Scheduling the Operation of a Very Large Oil Pipeline Network.

Arnaldo Vieira Moura, Cid C. de Souza, André A. Ciré, Tony Minoru Tamura Lopes

Proceedings of the Principles and Practice of Constraint Programming, 2008

On the Facial Structure of the Common Edge Subgraph polytope.

Gordana Manic, Laura Bahiense, Cid C. de Souza

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

Column Generation Algorithms for the Capacitated <i>m</i>-Ring-Star Problem.

Edna Ayako Hoshino, Cid C. de Souza

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

Column Generation Algorithms for the Capacitated m-Ring-Star Problem.

Edna Ayako Hoshino, Cid C. de Souza

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem.

Marcelo C. Couto, Cid C. de Souza, Pedro Jussieu de Rezende

Proceedings of the SIBGRAPI 2007, 2007

Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem.

Victor F. Cavalcante, Cid C. de Souza

Proceedings of the Combinatorics, 2007

2006

A column generation approach for SONET ring assignment.

Elder M. Macambira, Nelson Maculan, Cid C. de Souza

Networks, 2006

Vehicle and crew scheduling for urban bus lines.

Maikol M. Rodrigues, Cid C. de Souza, Arnaldo Vieira Moura

Eur. J. Oper. Res., 2006

Multiprocessor scheduling under precedence constraints: Polyhedral results.

Pablo E. Coll, Celso C. Ribeiro, Cid C. de Souza

Discret. Appl. Math., 2006

2005

Hybrid Column Generation Approaches for Urban Transit Crew Management Problems.

Tallys H. Yunes, Arnaldo Vieira Moura, Cid C. de Souza

Transp. Sci., 2005

Efficient datapath merging for partially reconfigurable architectures.

Nahri Moreano, Edson Borin, Cid C. de Souza, Guido Araujo

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2005

The vertex separator problem: algorithms and computations.

Cid C. de Souza, Egon Balas

Math. Program., 2005

The vertex separator problem: a polyhedral investigation.

Egon Balas, Cid C. de Souza

Math. Program., 2005

The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation.

Cid C. de Souza, André M. Lima, Guido Araujo, Nahri Moreano

ACM J. Exp. Algorithmics, 2005

A note on characterizing canonical cuts using geometry.

Elder M. Macambira, Nelson Maculan, Cid C. de Souza

Int. Trans. Oper. Res., 2005

Comparative Experiments with GRASP and Constraint Programming for the Oil Well Drilling Problem.

Romulo A. Pereira, Arnaldo Vieira Moura, Cid C. de Souza

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

2004

The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation.

Cid C. de Souza, André M. Lima, Nahri Moreano, Guido Araujo

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003

Optimal rectangular partitions.

Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza

Networks, 2003

2002

Rearrangement of DNA fragments: a branch-and-cut algorithm.

Carlos Eduardo Ferreira, C. Carvalho de Souza, Yoshiko Wakabayashi

Discret. Appl. Math., 2002

2001

Scheduling projects with labor constraints.

Cristina C. B. Cavalcante, C. Carvalho de Souza, Martin W. P. Savelsbergh, Y. Wang, Laurence A. Wolsey

Discret. Appl. Math., 2001

2000

Exact Solutions of Rectangular Partitions via Integer Programming.

Cláudio Nogueira de Meneses, Cid C. de Souza

Int. J. Comput. Geom. Appl., 2000

The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations.

Elder Magalhães Macambira, Cid Carvalho de Souza

Eur. J. Oper. Res., 2000

Scheduling under Labour Resource Constraints.

Susanne Heipcke, Yves Colombani, Cristina C. B. Cavalcante, Cid C. de Souza

Constraints An Int. J., 2000

Solving Very Large Crew Scheduling Problems to Optimality.

Tallys H. Yunes, Arnaldo Vieira Moura, Cid C. de Souza

Proceedings of the Applied Computing 2000, 2000

A Hybrid Approach for Solving Large Scale Crew Scheduling Problems.

Tallys H. Yunes, Arnaldo Vieira Moura, Cid C. de Souza

Proceedings of the Practical Aspects of Declarative Languages, 2000

1999

A new formulation for scheduling unrelated processor under precedence constraints.

Nelson Maculan, Stella C. S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza

RAIRO Oper. Res., 1999

1998

Static output feedback controllers: stability and convexity.

José Claudio Geromel, Cid C. de Souza, Robert E. Skelton

IEEE Trans. Autom. Control., 1998

The node capacitated graph partitioning problem: A computational study.

Carlos Eduardo Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey

Math. Program., 1998

1996

Formulations and valid inequalities for the node capacitated graph partitioning problem.

Carlos Eduardo Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey

Math. Program., 1996

1995

Some New Classes of Facets for the Equicut Polytope.

Cid C. de Souza, Monique Laurent

Discret. Appl. Math., 1995

1993

Heuristics for the Minimum Rectilinear Steiner Tree Problem: New Algorithms and a Computational Study.

C. Carvalho de Souza, Celso C. Ribeiro

Discret. Appl. Math., 1993