Pages that link to "Item:Q2503224"

The following pages link to Iterated local search for the quadratic assignment problem (Q2503224):

Displaying 38 items.

• In and out forests on combinatorial landscapes (Q299842) (← links)
• An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints (Q322469) (← links)
• Variable neighborhood search for the workload balancing problem in service enterprises (Q337226) (← links)
• Breakout local search for maximum clique problems (Q339563) (← links)
• An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
• The multi-story space assignment problem (Q610966) (← links)
• Solving the quadratic assignment problem by the repeated iterated tabu search method (Q681911) (← links)
• On the limitations of classical benchmark functions for evaluating robustness of evolutionary algorithms (Q846417) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• GEM: A novel evolutionary optimization method with improved neighborhood search (Q1021529) (← links)
• A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands (Q1023176) (← links)
• Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report (Q1038282) (← links)
• A matheuristic approach for the design of multiproduct batch plants with parallel production lines (Q1631517) (← links)
• Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem (Q1652176) (← links)
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
• Kernel technology to solve discrete optimization problems (Q1699399) (← links)
• Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations (Q1733092) (← links)
• A comparison of three metaheuristics for the workover rig routing problem (Q1926698) (← links)
• Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
• Multi-level departments-to-offices assignment with different room types (Q2002846) (← links)
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
• An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
• On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem (Q2285657) (← links)
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
• A priority-based genetic algorithm for a flexible job shop scheduling problem (Q2358304) (← links)
• The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
• Approaching the rank aggregation problem by local search-based metaheuristics (Q2423564) (← links)
• Neighborhood portfolio approach for local search applied to timetabling problems (Q2506215) (← links)
• An iterated local search algorithm for the vehicle routing problem with backhauls (Q2514876) (← links)
• On solving a hard quadratic 3-dimensional assignment problem (Q2516353) (← links)
• Neighborhood decomposition-driven variable neighborhood search for capacitated clustering (Q2669483) (← links)
• Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)
• PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID (Q2909213) (← links)
• An ejection chain algorithm for the quadratic assignment problem (Q3057181) (← links)
• Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study (Q5131726) (← links)
• Heuristics and matheuristics for a real‐life machine reassignment problem (Q5246825) (← links)
• The fractal geometry of fitness landscapes at the local optima level (Q6137183) (← links)
• Applying topological data analysis to local search problems (Q6154230) (← links)