Bounds-Consistent Local Search

DOI10.1007/11564751_108zbMATH Open1153.68493OpenAlexW1514626487MaRDI QIDQ3524232FDOQ3524232

Stefania Verachi, Steven Prestwich

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11564751_108

Recommendations

• Computational bounds for local search in combinatorial optimization
• Local search inequalities
• Theory and Applications of Satisfiability Testing
• Limits of local search: quality and efficiency
• scientific article; zbMATH DE number 6783433
• Local search in problems with nonconvex constraints
• Local search: complexity and approximation
• scientific article; zbMATH DE number 18751
• Applied local search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (3)

• Smoothed Performance Guarantees for Local Search
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• UnitWalk

This page was built for publication: Bounds-Consistent Local Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524232)