The following pages link to (Q4365126):
Displaying 17 items.
- Local search: is brute-force avoidable? (Q439931) (← links)
- A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- Hybrid methods in multi-criteria dynamic programming (Q850220) (← links)
- Computational approaches to a combinatorial optimization problem arising from text classification (Q868131) (← links)
- Golden ratio versus pi as random sequence sources for Monte Carlo integration (Q949528) (← links)
- Ant algorithms and simulated annealing for multicriteria dynamic programming (Q954043) (← links)
- The convergence of stochastic algorithms solving flow shop scheduling (Q1608340) (← links)
- Solving the shortest route cut and fill problem using simulated annealing (Q1869428) (← links)
- A tabu search heuristic and adaptive memory procedure for political districting (Q1869686) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- Equilibrium reliability measure for structural design under twofold uncertainty (Q2201684) (← links)
- Vehicle routing with dynamic travel times: a queueing approach (Q2426527) (← links)
- Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
- Searching for better fill-in (Q2453556) (← links)
- Memetic algorithms: The polynomial local search complexity theory perspective (Q2481603) (← links)
- Large neighborhood improvements for solving car sequencing problems (Q3534210) (← links)
