The following pages link to Vicente Campos (Q222770):
Displaying 20 items.
- Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
- Adaptive memory programming for matrix bandwidth minimization (Q541991) (← links)
- Tabu search and GRASP for the capacitated clustering problem (Q887182) (← links)
- (Q1176818) (redirect page) (← links)
- Polyhedral results for a vehicle routing problem (Q1176821) (← links)
- Intensification and diversification with elite tabu search solutions for the linear ordering problem (Q1302560) (← links)
- GRASP and path relinking for the matrix bandwidth minimization. (Q1417505) (← links)
- An experimental evaluation of a scatter search for the linear ordering problem (Q1850839) (← links)
- Tabu search tutorial. A graph drawing application (Q1979170) (← links)
- Rejoinder on: ``Tabu search tutorial. A graph drawing application'' (Q1979172) (← links)
- A branch and bound algorithm for the matrix bandwidth minimization (Q2462146) (← links)
- Variable neighborhood search for the linear ordering problem (Q2496057) (← links)
- Multiobjective GRASP with path relinking (Q2629598) (← links)
- Context-independent scatter and tabu search for permutation problems (Q2890461) (← links)
- (Q3337973) (← links)
- An algorithm for the Rural Postman problem on a directed graph (Q3730368) (← links)
- The Capacitated Arc Routing Problem: Lower bounds (Q4022732) (← links)
- (Q5323400) (← links)
- (Q5692634) (← links)
- Reducing the bandwidth of a sparse matrix with tabu search. (Q5952446) (← links)