Pages that link to "Item:Q4427376"

The following pages link to Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory (Q4427376):

Displaying 32 items.

• A hybrid data mining GRASP with path-relinking (Q336726) (← links)
• Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
• A GRASP-based approach for technicians and interventions scheduling for telecommunications (Q542005) (← links)
• Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
• Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
• Scatter search for network design problem (Q817138) (← links)
• Metaheuristics in combinatorial optimization (Q817206) (← links)
• A grasp-knapsack hybrid for a nurse-scheduling problem (Q835758) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• Tabu search and GRASP for the maximum diversity problem (Q857362) (← links)
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (Q862819) (← links)
• Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
• An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls (Q1037690) (← links)
• Solution of large weighted equicut problems (Q1609912) (← links)
• Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
• A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times (Q1651555) (← links)
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233) (← links)
• An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines (Q1762138) (← links)
• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
• Models and algorithms for optimising two-dimensional LEGO constructions (Q2028820) (← links)
• Optimisation and static equilibrium of three-dimensional LEGO constructions (Q2033391) (← links)
• A greedy randomized adaptive search procedure for the orienteering problem with hotel selection (Q2286963) (← links)
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
• Memetic algorithms (Q2573010) (← links)
• Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP (Q2629574) (← links)
• An ejection chain algorithm for the quadratic assignment problem (Q3057181) (← links)
• Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications (Q3644814) (← links)
• Randomized heuristics for the Max-Cut problem (Q4405937) (← links)
• An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
• Multi-start approach for an integer determinant maximization problem (Q4916310) (← links)
• A hybrid data mining metaheuristic for the <i>p</i>‐median problem (Q4969775) (← links)
• Metaheuristics: A Canadian Perspective (Q6102854) (← links)