César Rego
Orcid: 0000-0002-1713-2494
According to our database1,
César Rego
authored at least 37 papers
between 1998 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Adv. Eng. Softw., December, 2023
2019
Intensification, diversification, and learning via relaxation adaptive memory programming: a case study on resource constrained project scheduling.
J. Heuristics, 2019
Proceedings of the Business and Consumer Analytics: New Ideas, 2019
2018
Networks, 2018
Int. J. Appl. Metaheuristic Comput., 2018
Appl. Soft Comput., 2018
2017
New relationships for multi-neighborhood search for the minimum linear arrangement problem.
J. Discrete Algorithms, 2017
2016
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem.
Networks, 2016
Ann. Oper. Res., 2016
2015
2014
Manag. Sci., 2014
2012
Recommendations for an Undergraduate Curriculum at the Interface of Operations Research and Computer Science.
INFORMS Trans. Educ., 2012
2011
Int. J. Swarm Intell. Res., 2011
Int. J. Appl. Metaheuristic Comput., 2011
Traveling salesman problem heuristics: Leading methods, implementations and latest advances.
Eur. J. Oper. Res., 2011
Comput. Ind. Eng., 2011
Ann. Oper. Res., 2011
2010
Eur. J. Oper. Res., 2010
Proceedings of the 48th Annual Southeast Regional Conference, 2010
2009
Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem.
IEEE Trans. Syst. Man Cybern. Part A, 2009
Eur. J. Oper. Res., 2009
Eur. J. Oper. Res., 2009
2006
Comput. Oper. Res., 2006
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem.
Comput. Oper. Res., 2006
2005
Adv. Decis. Sci., 2005
Data structures and ejection chains for solving large-scale traveling salesman problems.
Eur. J. Oper. Res., 2005
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem.
Ann. Oper. Res., 2005
2004
OR Spectr., 2004
2002
Eur. J. Oper. Res., 2002
2001
Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms.
Parallel Comput., 2001
Technical note on the paper "An empirical study of a new metaheuristic for the traveling salesman problem" (by Shigeru Tsubakitani, James R. Evans, European Journal of Operational Research 104 (1998) 113-128).
Eur. J. Oper. Res., 2001
1999
J. Oper. Res. Soc., 1999
1998
Eur. J. Oper. Res., 1998