Pages that link to "Item:Q1804580"

The following pages link to Greedy randomized adaptive search procedures (Q1804580):

Displaying 50 items.

• Towards an efficient resolution of printing problems (Q2339840) (← links)
• A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
• ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms (Q2359156) (← links)
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
• Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
• A web-based decision support system for waste lube oils collection and recycling (Q2378411) (← links)
• Variable neighbourhood search for bandwidth reduction (Q2379517) (← links)
• Logic based methods for SNPs tagging and reconstruction (Q2379650) (← links)
• A multi-objective model for environmental investment decision making (Q2384603) (← links)
• Packing items to feed assembly lines (Q2384618) (← links)
• Local search-based hybrid algorithms for finding Golomb rulers (Q2385176) (← links)
• A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines (Q2393485) (← links)
• Multi-machine energy-aware scheduling (Q2397770) (← links)
• A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269) (← links)
• Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (Q2422923) (← links)
• Bayesian stopping rules for greedy randomized procedures (Q2433924) (← links)
• A biased random-key genetic algorithm for data clustering (Q2436000) (← links)
• Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
• Adaptive memory programming for the robust capacitated international sourcing problem (Q2456637) (← links)
• Global optimization by continuous grasp (Q2458920) (← links)
• Optimal placement of stereo sensors (Q2465570) (← links)
• A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs (Q2467257) (← links)
• Balancing and scheduling tasks in assembly lines with sequence-dependent setup times (Q2467265) (← links)
• Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics (Q2478380) (← links)
• Bilevel optimization applied to strategic pricing in competitive electricity markets (Q2479837) (← links)
• A scatter search approach for the minimum sum-of-squares clustering problem (Q2485180) (← links)
• Expanding neighborhood GRASP for the traveling salesman problem (Q2490365) (← links)
• Minimizing labor requirements in a periodic vehicle loading problem (Q2490369) (← links)
• Hybridization of GRASP metaheuristic with data mining techniques (Q2506213) (← links)
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem (Q2570156) (← links)
• A GRASP and path relinking heuristic for rural road network development (Q2573003) (← links)
• Memetic algorithms (Q2573010) (← links)
• Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP (Q2629574) (← links)
• Multiobjective GRASP with path relinking (Q2629598) (← links)
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem (Q2630221) (← links)
• Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling (Q2630226) (← links)
• A hybrid variable neighborhood search algorithm for targeted offers in direct marketing (Q2631264) (← links)
• An efficient GRASP algorithm for disassembly sequence planning (Q2642304) (← links)
• On some optimization problems in molecular biology (Q2643356) (← links)
• A review of vehicle routing with simultaneous pickup and delivery (Q2664320) (← links)
• The secure time-dependent vehicle routing problem with uncertain demands (Q2668686) (← links)
• Large-scale periodic scheduling in time-sensitive networks (Q2669618) (← links)
• A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
• The leader multipurpose shopping location problem (Q2672066) (← links)
• Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
• A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem (Q2675709) (← links)
• A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics (Q2678624) (← links)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs (Q2747806) (← links)
• GRASP: An annoted bibliography (Q2776563) (← links)