Pages that link to "Item:Q1919834"

The following pages link to Combining simulated annealing with local search heuristics (Q1919834):

Displayed 24 items.

• An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) ‎ (← links)
• A survey on optimization metaheuristics (Q497180) ‎ (← links)
• Heuristics for the mirrored traveling tournament problem (Q863992) ‎ (← links)
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) ‎ (← links)
• A direct stochastic algorithm for global search (Q1412565) ‎ (← links)
• Nature's way of optimizing (Q1575193) ‎ (← links)
• Metaheuristics for the single machine weighted quadratic tardiness scheduling problem (Q1651631) ‎ (← links)
• Guided local search and its application to the traveling salesman problem (Q1808420) ‎ (← links)
• Embedded local search approaches for routing optimization (Q1886851) ‎ (← links)
• Metaheuristics: A bibliography (Q1919858) ‎ (← links)
• Coupling ant colony systems with strong local searches (Q1926808) ‎ (← links)
• Stochastic optimization with adaptive restart: a framework for integrated local and global learning (Q2022223) ‎ (← links)
• Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) ‎ (← links)
• Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) ‎ (← links)
• A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows (Q2147032) ‎ (← links)
• Unscented hybrid simulated annealing for fast inversion of tunnel seismic waves (Q2417485) ‎ (← links)
• Iterated local search for the quadratic assignment problem (Q2503224) ‎ (← links)
• Hybrid Metaheuristics: An Introduction (Q2950517) ‎ (← links)
• A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles (Q3533189) ‎ (← links)
• COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗ (Q4820145) ‎ (← links)
• A Metaheuristic Approach to Compute Pure Nash Equilibria (Q5111130) ‎ (← links)
• METAHEURISTIC APPROACHES FOR THE MULTILEVEL RESOURCE-CONSTRAINED LOT-SIZING PROBLEM WITH SETUP AND LEAD TIMES (Q5315988) ‎ (← links)
• MPILS: an automatic tuner for MILP solvers (Q6047892) ‎ (← links)
• A multi-hybrid algorithm with shrinking population adaptation for constraint engineering design problems (Q6202967) ‎ (← links)