default search action
César Rego
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j36]César Rego, Frank Mathew:
Scatter search for capacitated minimum spanning tree. Adv. Eng. Softw. 186: 103555 (2023)
2010 – 2019
- 2019
- [j35]R. Christopher L. Riley, César Rego:
Intensification, diversification, and learning via relaxation adaptive memory programming: a case study on resource constrained project scheduling. J. Heuristics 25(4-5): 793-807 (2019) - [p1]Buyang Cao, César Rego, Fred W. Glover:
Hotel Classification Using Meta-Analytics: A Case Study with Cohesive Clustering. Business and Consumer Analytics: New Ideas 2019: 815-836 - 2018
- [j34]Yinhao Lu, Buyang Cao, César Rego
, Fred W. Glover:
A Tabu search based clustering algorithm and its parallel implementation on Spark. Appl. Soft Comput. 63: 97-109 (2018) - [j33]José Humberto Ablanedo-Rosas, César Rego
Assessing Algorithmic Performance by Frontier Analysis: A DEA Approach. Int. J. Appl. Metaheuristic Comput. 9(1): 78-94 (2018) - [j32]Fred W. Glover, César Rego
New assignment-based neighborhoods for traveling salesman and routing problems. Networks 71(3): 170-187 (2018) - 2017
- [j31]Fred W. Glover, César Rego
New relationships for multi-neighborhood search for the minimum linear arrangement problem. J. Discrete Algorithms 46-47: 16-24 (2017) - 2016
- [j30]Colin Osterman, César Rego
A k-level data structure for large-scale traveling salesman problems. Ann. Oper. Res. 244(2): 583-601 (2016) - [j29]César Rego
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem. Networks 68(1): 23-33 (2016) - 2015
- [j28]Buyang Cao, Fred W. Glover, César Rego
A tabu search algorithm for cohesive clustering problems. J. Heuristics 21(4): 457-477 (2015) - 2014
- [j27]Yuji Nakagawa, Ross J. W. James
Entropy-Based Optimization of Nonlinear Separable Discrete Decision Models. Manag. Sci. 60(3): 695-707 (2014) - 2012
- [j26]Jill R. Hardin, Allen Holder, J. Christopher Beck, Kevin C. Furman, Arthur Hanna, David J. Rader Jr., César Rego
Recommendations for an Undergraduate Curriculum at the Interface of Operations Research and Computer Science. INFORMS Trans. Educ. 12(3): 117-123 (2012) - 2011
- [j25]César Rego:
Preface. Ann. Oper. Res. 183(1): 1-5 (2011) - [j24]César Rego
A filter-and-fan approach to the 2D HP model of the protein folding problem. Ann. Oper. Res. 188(1): 389-414 (2011) - [j23]César Rego
A filter-and-fan algorithm for the capacitated minimum spanning tree problem. Comput. Ind. Eng. 60(2): 187-194 (2011) - [j22]César Rego
Traveling salesman problem heuristics: Leading methods, implementations and latest advances. Eur. J. Oper. Res. 211(3): 427-441 (2011) - [j21]Fred W. Glover, Leon S. Lasdon, John C. Plummer, Abraham Duarte, Rafael Martí, Manuel Laguna, César Rego:
Pseudo-Cut Strategies for Global Optimization. Int. J. Appl. Metaheuristic Comput. 2(4): 1-12 (2011) - [j20]Tabitha L. James, César Rego
Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem. Int. J. Swarm Intell. Res. 2(2): 52-70 (2011) - 2010
- [j19]César Rego
Ejection chain and filter-and-fan methods in combinatorial optimization. Ann. Oper. Res. 175(1): 77-105 (2010) - [j18]César Rego
RAMP for the capacitated minimum spanning tree problem. Ann. Oper. Res. 181(1): 661-681 (2010) - [j17]José Humberto Ablanedo-Rosas, César Rego
Surrogate constraint normalization for the set covering problem. Eur. J. Oper. Res. 205(3): 540-551 (2010) - [j16]César Rego
An ejection chain algorithm for the quadratic assignment problem. Networks 56(3): 188-206 (2010) - [c1]Chris Riley, César Rego, Haitao Li:
A simple dual-RAMP algorithm for resource constraint project scheduling. ACM Southeast Regional Conference 2010: 67
2000 – 2009
- 2009
- [j15]César Rego
A filter-and-fan approach to the job shop scheduling problem. Eur. J. Oper. Res. 194(3): 650-662 (2009) - [j14]Tabitha L. James, César Rego
A cooperative parallel tabu search algorithm for the quadratic assignment problem. Eur. J. Oper. Res. 195(3): 810-826 (2009) - [j13]Tabitha L. James, César Rego
Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem. IEEE Trans. Syst. Man Cybern. Part A 39(3): 579-596 (2009) - 2006
- [j12]Fred W. Glover, César Rego
Ejection chain and filter-and-fan methods in combinatorial optimization. 4OR 4(4): 263-296 (2006) - [j11]Dorabela Gamboa
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem. Comput. Oper. Res. 33: 1154-1172 (2006) - [j10]Peter Greistorfer, César Rego
A simple filter-and-fan approach to the facility location problem. Comput. Oper. Res. 33: 2590-2601 (2006) - 2005
- [j9]Gary A. Kochenberger, Fred W. Glover, Bahram Alidaee, César Rego
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem. Ann. Oper. Res. 139(1): 229-241 (2005) - [j8]Dorabela Gamboa
Data structures and ejection chains for solving large-scale traveling salesman problems. Eur. J. Oper. Res. 160(1): 154-171 (2005) - [j7]Bahram Alidaee, Fred W. Glover, Gary A. Kochenberger, César Rego
A new modeling and solution approach for the number partitioning problem. Adv. Decis. Sci. 9(2): 113-121 (2005) - 2004
- [j6]Gary A. Kochenberger, Fred W. Glover, Bahram Alidaee, César Rego
A unified modeling and solution framework for combinatorial optimization problems. OR Spectr. 26(2): 237-250 (2004) - 2002
- [j5]Fred W. Glover, Bahram Alidaee, César Rego
One-pass heuristics for large-scale unconstrained binary quadratic problems. Eur. J. Oper. Res. 137(2): 272-287 (2002) - 2001
- [j4]César Rego
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. 129(2): 456-459 (2001) - [j3]César Rego
Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms. Parallel Comput. 27(3): 201-222 (2001)
1990 – 1999
- 1999
- [j2]Luís Cavique
Subgraph ejection chains and tabu search for the crew scheduling problem. J. Oper. Res. Soc. 50(6): 608-616 (1999) - 1998
- [j1]César Rego
Relaxed tours and path ejections for the traveling salesman problem. Eur. J. Oper. Res. 106(2-3): 522-538 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: