Pages that link to "Item:Q4452890"

The following pages link to Scatter Search and Path Relinking: Advances and Applications (Q4452890):

Displaying 31 items.

• Evaluation of multitype mathematical models for CFSE-labeling experiment data (Q417351) (← links)
• A survey on optimization metaheuristics (Q497180) (← links)
• Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection (Q541996) (← links)
• A unified framework for population-based metaheuristics (Q646652) (← links)
• Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
• A rough set approach to feature selection based on scatter search metaheuristic (Q741887) (← links)
• Multiterminal net assignments by scatter search (Q814239) (← links)
• Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
• A path-relinking approach for a bi-criteria disassembly sequencing problem (Q925845) (← links)
• Scatter search for the 0-1 multidimensional knapsack problem (Q928688) (← links)
• Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
• GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (Q1652080) (← links)
• Solving large-scale TSP using a fast wedging insertion partitioning approach (Q1666767) (← links)
• A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems (Q1753628) (← links)
• Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
• A dual RAMP algorithm for single source capacitated facility location problems (Q2240710) (← links)
• Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
• Industrial aspects and literature survey: Combined inventory management and routing (Q2270436) (← links)
• Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem (Q2331412) (← links)
• Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← links)
• A particle swarm optimization algorithm with path relinking for the location routing problem (Q2481605) (← links)
• Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308) (← links)
• Scatter search --- wellsprings and challenges (Q2570140) (← links)
• A scatter search heuristic for the capacitated clustering problem (Q2570154) (← links)
• Scatter search for the vehicle routing problem with time windows (Q2570159) (← links)
• Data-mining-driven neighborhood search (Q2815441) (← links)
• Memory and Learning in Metaheuristics (Q2866122) (← links)
• (Q4667330) (← links)
• Application of Metaheuristics to Large-Scale Transportation Problems (Q5116364) (← links)
• Adaptive Tunning of All Parameters in a Multi-Swarm Particle Swarm Optimization Algorithm: An Application to the Probabilistic Traveling Salesman Problem (Q5270513) (← links)
• A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem (Q5387635) (← links)