The following pages link to Rafael Martí (Q191784):
Displaying 50 items.
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
- GRASP and path relinking for the equitable dispersion problem (Q336711) (← links)
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem (Q336883) (← links)
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
- Scatter search for an uncapacitated \(p\)-hub median problem (Q337508) (← links)
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
- Scatter search for the bandpass problem (Q524910) (← links)
- Heuristics for the bandwidth colouring problem (Q537987) (← links)
- Adaptive memory programming for matrix bandwidth minimization (Q541991) (← links)
- Hybrid scatter tabu search for unconstrained global optimization (Q542001) (← links)
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization. (Q612873) (← links)
- An evolutionary method for complex-process optimization (Q732898) (← links)
- A black-box scatter search for optimization problems with integer variables (Q742141) (← links)
- Tabu search and GRASP for the maximum diversity problem (Q857362) (← links)
- Scatter search for chemical and bio-process optimization (Q878229) (← links)
- Tabu search and GRASP for the capacitated clustering problem (Q887182) (← links)
- Hybridizing the cross-entropy method: An application to the max-cut problem (Q954050) (← links)
- Black box scatter search for general classes of binary optimization problems (Q976017) (← links)
- Heuristics for the bi-objective path dissimilarity problem (Q1025234) (← links)
- Improved scatter search for the global optimization of computationally expensive dynamic models (Q1029673) (← links)
- GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (Q1266546) (← links)
- (Q1302559) (redirect page) (← links)
- Intensification and diversification with elite tabu search solutions for the linear ordering problem (Q1302560) (← links)
- ARC crossing minimization in hierarchical digraphs with tabu search (Q1373159) (← links)
- GRASP and path relinking for the matrix bandwidth minimization. (Q1417505) (← links)
- A tabu search algorithm for the bipartite drawing problem (Q1609918) (← links)
- Heuristics for the constrained incremental graph drawing problem (Q1634310) (← links)
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (Q1652080) (← links)
- Heuristics for the capacitated modular hub location problem (Q1652383) (← links)
- Tabu search for the dynamic bipartite drawing problem (Q1652530) (← links)
- (Q1687676) (redirect page) (← links)
- Variable neighborhood descent for the incremental graph drawing (Q1687677) (← links)
- Variable neighborhood scatter search for the incremental graph drawing problem (Q1694406) (← links)
- Metaheuristics for business analytics. A decision modeling approach (Q1746138) (← links)
- Scatter search for the cutwidth minimization problem (Q1761768) (← links)
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization (Q1811085) (← links)
- A GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
- An experimental evaluation of a scatter search for the linear ordering problem (Q1850839) (← links)
- Scatter search. Methodology and implementation in C. With CD-ROM. (Q1869927) (← links)
- Multilayer neural networks: an experimental evaluation of on-line training methods (Q1881654) (← links)
- A tabu thresholding algorithm for arc crossing minimization in bipartite graphs (Q1919842) (← links)
- Heuristics for the mixed rural postman problem (Q1968592) (← links)
- Tabu search tutorial. A graph drawing application (Q1979170) (← links)
- Rejoinder on: ``Tabu search tutorial. A graph drawing application'' (Q1979172) (← links)
- Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
- Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem (Q2122552) (← links)
