scientific article
From MaRDI portal
Publication:3975934
zbMath0778.90058MaRDI QIDQ3975934
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyneural networkslocal searchlocal optimizationworst-case complexitycontinuous problemslocal search heuristicsdiscrete, combinatorial problemslow- order polynomial time
Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (13)
How difficult is the frequency selection problem? ⋮ Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue ⋮ Metaheuristics: A bibliography ⋮ Parallel local search ⋮ A new extension of local search applied to the Dial-A-Ride problem ⋮ Expansion-based hill-climbing ⋮ A local search template. ⋮ Equilibria, fixed points, and complexity classes ⋮ The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Mechanisms for local search ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Tabu search for resource-constrained scheduling
This page was built for publication:
