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:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Scatter search for capacitated minimum spanning tree.
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

Hotel Classification Using Meta-Analytics: A Case Study with Cohesive Clustering.
Proceedings of the Business and Consumer Analytics: New Ideas, 2019

2018
New assignment-based neighborhoods for traveling salesman and routing problems.
Networks, 2018

Assessing Algorithmic Performance by Frontier Analysis: A DEA Approach.
Int. J. Appl. Metaheuristic Comput., 2018

A Tabu search based clustering algorithm and its parallel implementation on Spark.
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

A k-level data structure for large-scale traveling salesman problems.
Ann. Oper. Res., 2016

2015
A tabu search algorithm for cohesive clustering problems.
J. Heuristics, 2015

2014
Entropy-Based Optimization of Nonlinear Separable Discrete Decision Models.
Manag. Sci., 2014

2012
Recommendations for an Undergraduate Curriculum at the Interface of Operations Research and Computer Science.
INFORMS Trans. Educ., 2012

2011
Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem.
Int. J. Swarm Intell. Res., 2011

Pseudo-Cut Strategies for Global Optimization.
Int. J. Appl. Metaheuristic Comput., 2011

Traveling salesman problem heuristics: Leading methods, implementations and latest advances.
Eur. J. Oper. Res., 2011

A filter-and-fan algorithm for the capacitated minimum spanning tree problem.
Comput. Ind. Eng., 2011

A filter-and-fan approach to the 2D HP model of the protein folding problem.
Ann. Oper. Res., 2011

Preface.
Ann. Oper. Res., 2011

2010
An ejection chain algorithm for the quadratic assignment problem.
Networks, 2010

Surrogate constraint normalization for the set covering problem.
Eur. J. Oper. Res., 2010

RAMP for the capacitated minimum spanning tree problem.
Ann. Oper. Res., 2010

A simple dual-RAMP algorithm for resource constraint project scheduling.
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

A filter-and-fan approach to the job shop scheduling problem.
Eur. J. Oper. Res., 2009

A cooperative parallel tabu search algorithm for the quadratic assignment problem.
Eur. J. Oper. Res., 2009

2006
A simple filter-and-fan approach to the facility location problem.
Comput. Oper. Res., 2006

Implementation analysis of efficient heuristic algorithms for the traveling salesman problem.
Comput. Oper. Res., 2006

Ejection chain and filter-and-fan methods in combinatorial optimization.
4OR, 2006

2005
A new modeling and solution approach for the number partitioning problem.
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
A unified modeling and solution framework for combinatorial optimization problems.
OR Spectr., 2004

2002
One-pass heuristics for large-scale unconstrained binary quadratic problems.
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
Subgraph ejection chains and tabu search for the crew scheduling problem.
J. Oper. Res. Soc., 1999

1998
Relaxed tours and path ejections for the traveling salesman problem.
Eur. J. Oper. Res., 1998


  Loading...