The following pages link to Rafael Martí (Q191784):
Displaying 50 items.
- Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
- Multi-start methods for combinatorial optimization (Q2253534) (← links)
- Tabu search for min-max edge crossing in graphs (Q2337395) (← links)
- A branch and bound algorithm for the maximum diversity problem (Q2379521) (← links)
- Adaptive memory programming for constrained global optimization (Q2379660) (← links)
- Strategic oscillation for the quadratic multiple knapsack problem (Q2450910) (← links)
- Adaptive memory programming for the robust capacitated international sourcing problem (Q2456637) (← links)
- A branch and bound algorithm for the matrix bandwidth minimization (Q2462146) (← links)
- Variable neighborhood search for the linear ordering problem (Q2496057) (← links)
- GRASP for seam drawing in mosaicking of aerial photographic maps (Q2567873) (← links)
- Scatter search --- wellsprings and challenges (Q2570140) (← links)
- Principles of scatter search (Q2570141) (← links)
- Path relinking and GRG for artificial neural networks (Q2570150) (← links)
- An empirical study of learning speed in back-propagation networks (Q2573009) (← links)
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions (Q2583180) (← links)
- Multiobjective GRASP with path relinking (Q2629598) (← links)
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies (Q2631232) (← links)
- Hybrid heuristics for the maximum diversity problem (Q2655404) (← links)
- A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands (Q2668800) (← links)
- A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
- A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics (Q2678624) (← links)
- Fundamentals of scatter search and path relinking (Q2731676) (← links)
- Context-independent scatter and tabu search for permutation problems (Q2890461) (← links)
- SSPMO: a scatter tabu search procedure for non-linear multiobjective optimization (Q2892315) (← links)
- GRASP and path relinking for the two-dimensional two-stage cutting-stock problem (Q2892334) (← links)
- Scatter search and local NLP solvers: a multistart framework for global optimization (Q2892345) (← links)
- Scatter search for the point-matching problem in 3D image registration (Q2900994) (← links)
- Advanced scatter search for the max-cut problem (Q2901043) (← links)
- (Q3022222) (← links)
- GRASP with path relinking heuristics for the antibandwidth problem (Q3100697) (← links)
- (Q4350040) (← links)
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization (Q4427360) (← links)
- Scatter Search and Path Relinking: Advances and Applications (Q4452890) (← links)
- Multi-Start Methods (Q4452901) (← links)
- (Q4656643) (← links)
- (Q4667330) (← links)
- (Q4667339) (← links)
- Improved heuristics for the regenerator location problem (Q5175825) (← links)
- Models and solution methods for the uncapacitated <i>r</i>‐allocation <i>p</i>‐hub equitable center problem (Q5374519) (← links)
- (Q5431856) (← links)
- (Q5431861) (← links)
- (Q5692623) (← links)
- (Q5692634) (← links)
- A GRASP for coloring sparse graphs (Q5938473) (← links)
- Reducing the bandwidth of a sparse matrix with tabu search. (Q5952446) (← links)
- Incremental bipartite drawing problem (Q5955967) (← links)
- The Rural Postman Problem on mixed graphs with turn penalties (Q5959378) (← links)
- General variable neighborhood search for the minimum stretch spanning tree problem (Q6063503) (← links)
- Heuristics for the capacitated dispersion problem (Q6070413) (← links)
- A parallel variable neighborhood search approach for the obnoxious <i>p</i>‐median problem (Q6088247) (← links)
