Computational bounds for local search in combinatorial optimization

DOI10.1134/S0965542508050059zbMath1164.90388MaRDI QIDQ3545176

Yury A. Kochetov

Publication date: 9 December 2008

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

metaheuristicslocal searchPLS problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (4)

Classification of applied methods of combinatorial optimization ⋮ Comparison of models of planning public-private partnership ⋮ Approximate solution of the \(p\)-median minimization problem ⋮ On solving Travelling Salesman Problem with Vertex Requisitions

This page was built for publication: Computational bounds for local search in combinatorial optimization