Cid C. de Souza

According to our database1, Cid C. de Souza authored at least 92 papers between 1993 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
A matheuristic for the firefighter problem on graphs.
Int. Trans. Oper. Res., 2020

2019
Solving dynamic labeling problems to optimality using solution space reductions.
Theor. Comput. Sci., 2019

Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax-and-fix heuristic.
Int. Trans. Oper. Res., 2019

Solving the geometric firefighter routing problem via integer programming.
Eur. J. Oper. Res., 2019

A GRASP for the Convex Recoloring Problem in Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Minimum Convex Partition of Point Sets.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018
Finding exact solutions for the Geometric Firefighter Problem in practice.
Comput. Oper. Res., 2018

Optimal Solutions for a Geometric Knapsack Problem using Integer Programming.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Minimum stabbing rectangular partitions of rectilinear polygons.
Comput. Oper. Res., 2017

Fast Optimal Labelings for Rotating Maps.
Proceedings of the WALCOM: Algorithms and Computation, 2017

2016
Engineering Art Galleries.
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.
ACM Trans. Math. Softw., 2016

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

Lower bounds for large traveling umpire instances: New valid inequalities and a branch-and-cut algorithm.
Comput. Oper. Res., 2016

Exact Solutions for the Geometric Firefighter Problem.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
On the complexity of the traveling umpire problem.
Theor. Comput. Sci., 2015

The Eternal Dominating Set problem for proper interval graphs.
Inf. Process. Lett., 2015

Partitions of Rectilinear Polygons with Minimum Stabbing Number.
Electron. Notes Discret. Math., 2015

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

Solving the natural wireless localization problem to optimality efficiently.
Comput. Geom., 2015

Computing Bounds for Eternal Domination.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Computing Minimum Dilation Spanning Trees in Geometric Graphs.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Integer programming approaches for minimum stabbing problems.
RAIRO Oper. Res., 2014

Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation.
INFORMS J. Comput., 2014

Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic.
Eur. J. Oper. Res., 2014

Engineering Art Galleries.
CoRR, 2014

An Exact Algorithm for the Discrete Chromatic Art Gallery Problem.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

An Integer Programming Formulation for the Maximum k-Subset Intersection Problem.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Minimum Dilation Triangulation: Reaching Optimality Efficiently.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Arc-based integer programming formulations for three variants of proportional symbol maps.
Electron. Notes Discret. Math., 2013

Intersecting a simple mixed integer set with a vertex packing set.
Electron. Notes Discret. Math., 2013

A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps.
Comput. Oper. Res., 2013

The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Point guards and point clouds: solving general art gallery problems.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

An Efficient Exact Algorithm for the Natural Wireless Localization Problem.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Generating optimal drawings of physically realizable symbol maps with integer programming.
Vis. Comput., 2012

The maximum common edge subgraph problem: A polyhedral investigation.
Discret. Appl. Math., 2012

Planning the operation of a large real-world oil pipeline.
Comput. Chem. Eng., 2012

Polyhedral study of the maximum common induced subgraph problem.
Ann. Oper. Res., 2012

The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
A branch-and-price approach for the partition coloring problem.
Oper. Res. Lett., 2011

Exact algorithms for the vertex separator problem in graphs.
Networks, 2011

An exact algorithm for minimizing vertex guards on art galleries.
Int. Trans. Oper. Res., 2011

New branch-and-bound algorithms for k-cardinality tree problems.
Electron. Notes Discret. Math., 2011

The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm.
Discret. Appl. Math., 2011

An exact approach to the problem of extracting an embedded network matrix.
Comput. Oper. Res., 2011

Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Determining an Optimal Visualization of Physically Realizable Symbol Maps.
Proceedings of the 24th SIBGRAPI Conference on Graphics, 2011

Optimizing the Layout of Proportional Symbol Maps.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Effective drawing of proportional symbol maps using GRASP.
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.
Electron. Notes Discret. Math., 2010

A hybrid model for a multiproduct pipeline planning and scheduling problem.
Constraints An Int. J., 2010

2009
Upper and lower bounding procedures for the minimum caterpillar spanning problem.
Electron. Notes Discret. Math., 2009

A branch&cut algorithm for the maximum common edge subgraph problem.
Electron. Notes Discret. Math., 2009

A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem.
Electron. Notes Discret. Math., 2009

An IP solution to the art gallery problem.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

An Exact Method for the Minimum Caterpillar Spanning Problem.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Acyclic Orientations with Path Constraints.
RAIRO Oper. Res., 2008

Scheduling activities at oil wells with resource displacement.
Int. Trans. Oper. Res., 2008

A Relax-and-Cut algorithm for the set partitioning problem.
Comput. Oper. Res., 2008

Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Heuristics and Constraint Programming Hybridizations for a Real Pipeline Planning and Scheduling Problem.
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.
Proceedings of the Principles and Practice of Constraint Programming, 2008

On the Facial Structure of the Common Edge Subgraph polytope.
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.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

Column Generation Algorithms for the Capacitated m-Ring-Star Problem.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem.
Proceedings of the SIBGRAPI 2007, 2007

Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem.
Proceedings of the Combinatorics, 2007

2006
A column generation approach for SONET ring assignment.
Networks, 2006

Vehicle and crew scheduling for urban bus lines.
Eur. J. Oper. Res., 2006

Multiprocessor scheduling under precedence constraints: Polyhedral results.
Discret. Appl. Math., 2006

2005
Hybrid Column Generation Approaches for Urban Transit Crew Management Problems.
Transp. Sci., 2005

Efficient datapath merging for partially reconfigurable architectures.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2005

The vertex separator problem: algorithms and computations.
Math. Program., 2005

The vertex separator problem: a polyhedral investigation.
Math. Program., 2005

The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation.
ACM J. Exp. Algorithmics, 2005

A note on characterizing canonical cuts using geometry.
Int. Trans. Oper. Res., 2005

Comparative Experiments with GRASP and Constraint Programming for the Oil Well Drilling Problem.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

2004
The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003
Optimal rectangular partitions.
Networks, 2003

2002
Rearrangement of DNA fragments: a branch-and-cut algorithm.
Discret. Appl. Math., 2002

2001
Scheduling projects with labor constraints.
Discret. Appl. Math., 2001

2000
Exact Solutions of Rectangular Partitions via Integer Programming.
Int. J. Comput. Geom. Appl., 2000

The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations.
Eur. J. Oper. Res., 2000

Scheduling under Labour Resource Constraints.
Constraints An Int. J., 2000

Solving Very Large Crew Scheduling Problems to Optimality.
Proceedings of the Applied Computing 2000, 2000

A Hybrid Approach for Solving Large Scale Crew Scheduling Problems.
Proceedings of the Practical Aspects of Declarative Languages, 2000

1999
A new formulation for scheduling unrelated processor under precedence constraints.
RAIRO Oper. Res., 1999

1998
The node capacitated graph partitioning problem: A computational study.
Math. Program., 1998

1996
Formulations and valid inequalities for the node capacitated graph partitioning problem.
Math. Program., 1996

1995
Some New Classes of Facets for the Equicut Polytope.
Discret. Appl. Math., 1995

1993
Heuristics for the Minimum Rectilinear Steiner Tree Problem: New Algorithms and a Computational Study.
Discret. Appl. Math., 1993


  Loading...