Rafael G. Cano

According to our database, Rafael G. Cano authored at least 8 papers between 2011 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

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

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

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

2015

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

Discret. Optim., 2015

Mosaic Drawings and Cartograms.

Rafael G. Cano, Kevin Buchin, Thom Castermans, Astrid Pieterse, Willem Sonke, Bettina Speckmann

Comput. Graph. Forum, 2015

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

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