Local Search: Simple, Successful, But Sometimes Sluggish
From MaRDI portal
Publication:3587365
DOI10.1007/978-3-642-14165-2_1zbMath1287.68157OpenAlexW1582262193MaRDI QIDQ3587365
Burkhard Monien, Dominic Dumrauf, Tobias Tscheuschner
Publication date: 7 September 2010
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_1
Abstract computational complexity for mathematical programming problems (90C60) Games involving graphs (91A43) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (5)
Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems ⋮ Computing Stable Outcomes in Hedonic Games ⋮ Complexity of single-swap heuristics for metric facility location and related problems ⋮ Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games ⋮ Settling the Complexity of Local Max-Cut (Almost) Completely
Uses Software
This page was built for publication: Local Search: Simple, Successful, But Sometimes Sluggish
