scientific article; zbMATH DE number 2087632

zbMATH Open1077.68836MaRDI QIDQ4738481FDOQ4738481

Authors: Peter Niebert, S. Zennou, D. Lugiez 

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2318/23180221.htm

Title of this publication is not available (Why is that?)

Recommendations

• Bounds-Consistent Local Search
• scientific article; zbMATH DE number 5510694
• Computational bounds for local search in combinatorial optimization
• Local search: complexity and approximation
• Local optimization of dynamic programs with guaranteed satisfaction of path constraints
• Contraint-based combinators for local search
• Logic Programming
• Local search proximal algorithms as decision dynamics with costs to move

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (2)

• Stronger Reduction Criteria for Local First Search
• Title not available (Why is that?)

This page was built for publication:

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