Pages that link to "Item:Q1804580"
From MaRDI portal
The following pages link to Greedy randomized adaptive search procedures (Q1804580):
Displaying 50 items.
- GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem (Q503664) (← links)
- An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation (Q506145) (← links)
- A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
- Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs (Q521579) (← links)
- Scatter search for the bandpass problem (Q524910) (← links)
- Local search for the undirected capacitated arc routing problem with profits (Q531469) (← links)
- A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680) (← links)
- A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times (Q552221) (← links)
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem (Q609809) (← links)
- The single period coverage facility location problem: Lagrangean heuristic and column generation approaches (Q610996) (← links)
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
- A guided reactive GRASP for the capacitated multi-source Weber problem (Q622155) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- A GRASP with evolutionary path relinking for the truck and trailer routing problem (Q632678) (← links)
- A hybrid ACO-GRASP algorithm for clustering analysis (Q646719) (← links)
- A fast algorithm for robust regression with penalised trimmed squares (Q650724) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- Heuristics and lower bounds for minimizing fuel consumption in hybrid-electrical vehicles (Q681296) (← links)
- Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433) (← links)
- Restart strategies for GRASP with path-relinking heuristics (Q691439) (← links)
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145) (← links)
- Continuous GRASP with a local active-set method for bound-constrained global optimization (Q708907) (← links)
- A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization (Q711332) (← links)
- A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution (Q763242) (← links)
- GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
- Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems (Q764792) (← links)
- Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization (Q780956) (← links)
- Scatter search for network design problem (Q817138) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- A combinatorial algorithm for the TDMA message scheduling problem (Q839680) (← links)
- Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis (Q840098) (← links)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
- Tabu search and GRASP for the maximum diversity problem (Q857362) (← links)
- Inventory routing with continuous moves (Q858281) (← links)
- Heuristics for matrix bandwidth reduction (Q858330) (← links)
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (Q862819) (← links)
- Optimizing base station location and configuration in UMTS networks (Q863576) (← links)
- Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
- A tabu search approach for solving a difficult forest harvesting machine location problem (Q863994) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- On the number of local minima for the multidimensional assignment problem (Q867022) (← links)
- Short-term work scheduling with job assignment flexibility for a multi-fleet transport system (Q869153) (← links)
- A reactive GRASP and path relinking for a combined production-distribution problem (Q883304) (← links)
- Coalition structure generation: a survey (Q900307) (← links)
- A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems (Q902099) (← links)
