Rego Csar

Csar Rego

Information about the author Csar Rego will soon be added to the site.
Found 15 papers in total
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem
2016
Ejection chain methods, which include the classical Lin–Kernighan (LK) procedure...
A k-level data structure for large-scale traveling salesman problems
A k-level data structure for large-scale traveling salesman problems
2016
The problem of data representation is fundamental to the efficiency of search...
A filter‐and‐fan approach to the 2D HP model of the protein folding problem
A filter‐and‐fan approach to the 2D HP model of the protein folding problem
2011
We examine a prominent and widely‐studied model of the protein folding problem,...
Traveling salesman problem heuristics: Leading methods, implementations and latest advances
Traveling salesman problem heuristics: Leading methods, implementations and latest advances
2011
Heuristics for the traveling salesman problem (TSP) have made remarkable advances in...
Ejection chain and filter-and-fan methods in combinatorial optimization
Ejection chain and filter-and-fan methods in combinatorial optimization
2010
The design of effective neighborhood structures is fundamentally important for...
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
2006
The state-of-the-art of local search heuristics for the traveling salesman problem...
A simple filter-and-fan approach to the facility location problem
A simple filter-and-fan approach to the facility location problem
2006
The design of effective neighborhood search procedures is a primary issue for the...
Data structures and ejection chains for solving large-scale traveling salesman problems
Data structures and ejection chains for solving large-scale traveling salesman problems
2005
Data structures play a crucial role in the efficient implementation of local search...
Neighborhood structures and local search for the maximum clique problem
Neighborhood structures and local search for the maximum clique problem
2002
The Maximum Clique is an NP-hard problem aiming at finding the largest complete...
One-pass heuristics for large-scale unconstrained binary quadratic problems
One-pass heuristics for large-scale unconstrained binary quadratic problems
2002
Many significant advances have been made in recent years for solving unconstrained...
A subpath ejection method for the vehicle routing problem
A subpath ejection method for the vehicle routing problem
1998
Generically, ejection chains are methods conceived to allow solution transformations...
Relaxed tours and path ejections for the traveling salesman problem
Relaxed tours and path ejections for the traveling salesman problem
1998
We describe an edge based ejection chain method to generate compound neighborhood...
Some thoughts on combinatorial optimisation
Some thoughts on combinatorial optimisation
1995
A group of young researchers from the ESI X summer school, HEC, Jouy-en-Josas 1994,...
Using Tabu search for solving a dynamic multi-terminal truck dispatching problem
Using Tabu search for solving a dynamic multi-terminal truck dispatching problem
1995
In this paper we describe a two-phase based algorithm for a real-life tank truck...
A tabu search heuristic for a vehicle routing problem
A tabu search heuristic for a vehicle routing problem
1994
The purpose of this paper is to describe a new tabu search heuristic for the vehicle...
Papers per page: