scientific article; zbMATH DE number 1082099

zbMath0906.90143MaRDI QIDQ4365126

Jan Karel Lenstra, Emile H. L. Aarts

Publication date: 21 December 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

neural networkssimulated annealingtabu searchgenetic algorithmslocal search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (17)

Hybrid methods in multi-criteria dynamic programming ⋮ Computational approaches to a combinatorial optimization problem arising from text classification ⋮ Vehicle routing with dynamic travel times: a queueing approach ⋮ Equilibrium reliability measure for structural design under twofold uncertainty ⋮ Local search: is brute-force avoidable? ⋮ Local search for string problems: brute-force is essentially optimal ⋮ Large neighborhood improvements for solving car sequencing problems ⋮ Searching for better fill-in ⋮ A discrete gravitational search algorithm for solving combinatorial optimization problems ⋮ Golden ratio versus pi as random sequence sources for Monte Carlo integration ⋮ Ant algorithms and simulated annealing for multicriteria dynamic programming ⋮ Memetic algorithms: The polynomial local search complexity theory perspective ⋮ Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search ⋮ On the parameterized complexity of consensus clustering ⋮ The convergence of stochastic algorithms solving flow shop scheduling ⋮ Solving the shortest route cut and fill problem using simulated annealing ⋮ A tabu search heuristic and adaptive memory procedure for political districting

This page was built for publication: