Follow
Carlos Alberto Martinhon
Carlos Alberto Martinhon
Professor de Ciência da Computação, Universidade Federal Fluminense
Verified email at dcc.ic.uff.br
Title
Cited by
Cited by
Year
Paths and trails in edge-colored graphs
A Abouelaoualim, KC Das, L Faria, Y Manoussakis, C Martinhon, R Saad
Theoretical Computer Science 409 (3), 497-510, 2008
622008
Stronger k-tree relaxations for the vehicle routing problem
C Martinhon, A Lucena, N Maculan
European Journal of Operational Research 158 (1), 56-71, 2004
612004
Partition into cliques for cubic graphs: Planar case, complexity and approximation
MR Cerioli, L Faria, TO Ferreira, CAJ Martinhon, F Protti, B Reed
Discrete Applied Mathematics 156 (12), 2270-2278, 2008
552008
The minimum reload s–t path, trail and walk problems
L Gourvès, A Lyra, C Martinhon, J Monnot
Discrete Applied Mathematics 158 (13), 1404-1417, 2010
462010
The minimum reload s–t path, trail and walk problems
L Gourvès, A Lyra, C Martinhon, J Monnot
Discrete Applied Mathematics 158 (13), 1404-1417, 2010
462010
Cycles and paths in edge‐colored graphs with given degrees
A Abouelaoualim, KC Das, WF de la Vega, M Karpinski, Y Manoussakis, ...
Journal of Graph Theory 64 (1), 63-86, 2010
362010
An Hybrid GRASP+ VND Metaheuristic for the Prize-Collecting Traveling Salesman Problem
LM Gomes, VB Diniz, CA Martinhon
XXXII Simpósio Brasileiro de Pesquisa Operacional, 1657-1665, 2000
282000
Grasp metaheuristics for the generalized covering tour problem
L Motta, LS Ochi, C Martinhon
MIC2001-4th Metaheuristics Int Conf. Porto, Portugal, 2001
252001
Complexity of trails, paths and circuits in arc-colored digraphs
L Gourvès, A Lyra, CA Martinhon, J Monnot
Discrete Applied Mathematics 161 (6), 819-828, 2013
232013
A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow
PH Gonzalez, L Simonetti, P Michelon, C Martinhon, E Santos
Computers & Operations Research 76, 134-146, 2016
212016
On paths, trails and closed trails in edge-colored graphs
L Gourves, A Lyra, CA Martinhon, J Monnot
Discrete Mathematics & Theoretical Computer Science 14 (Graph Theory), 2012
172012
A relax and cut algorithm for the vehicle routing problem
C Martinhon, A Lucena, N Maculan
European Journal of Operational Research 35 (6), 56-71, 2000
172000
Randomized generation of acyclic orientations upon anonymous distributed systems
GM Arantes Jr, FMG França, CA Martinhon
Journal of Parallel and Distributed Computing 69 (3), 239-246, 2009
132009
On st paths and trails in edge-colored graphs
L Gourvès, A Lyra, C Martinhon, J Monnot, F Protti
Electronic Notes in Discrete Mathematics 35, 221-226, 2009
122009
Metaheurísticas híbridas para o problema do caixeiro viajante com coleta de prêmios
VA Melo, CA Martinhon
Simpósio Brasileiro de Pesquisa Operacional (SBPO) 36, 1295-1306, 2004
102004
ALgoritmos randômicos para a geração de orientações acíclicas em sistemas distribuídos
GM Arantes Jr, FMG França, CA Martinhon
Anais do XXXIV Simpósio Brasileiro de Pesquisa Operacional, 2002
82002
Uma Metaheurística GRASP para o Problema de Planejamento de Redes com Rotas Ótimas para o Usuário
PH González, C Martinhon, L Simonetti, E Santos, P Michelon
XLV Simpósio Brasileiro de Pesquisa Operacional (Natal, 2013), 1813-1824, 2013
72013
Maximum colored trees in edge-colored graphs
V Borozan, WF de La Vega, Y Manoussakis, C Martinhon, R Muthu, ...
European Journal of Combinatorics 80, 296-310, 2019
62019
Complexity of paths, trails and circuits in arc-colored digraphs
L Gourves, A Lyra, C Martinhon, J Monnot
Theory and Applications of Models of Computation: 7th Annual Conference …, 2010
62010
Gerando orientações acíclicas com algoritmos probabilísticos distribuídos
GM Arantes Jr, FMG França, CA Martinhon
Pesquisa Operacional 25, 301-312, 2005
52005
The system can't perform the operation now. Try again later.
Articles 1–20