Local search with constraint propagation and conflict-based heuristics
Narendra Jussien,Olivier Lhomme +1 more
Reads0
Chats0
TLDR
Tabu decision repair as discussed by the authors performs a local search over partial assignments instead of complete assignments, and uses filtering techniques and conflict-based techniques to efficiently guide the search, which benefits from both classical approaches: a priori pruning of the search space from filtering-based search and possible repair of early mistakes from local search.About:
This article is published in Artificial Intelligence.The article was published on 2002-07-01 and is currently open access. It has received 175 citations till now. The article focuses on the topics: Guided Local Search & Beam search.read more
Citations
More filters
Journal ArticleDOI
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
Christian Blum,Andrea Roli +1 more
TL;DR: A survey of the nowadays most important metaheuristics from a conceptual point of view and introduces a framework, that is called the I&D frame, in order to put different intensification and diversification components into relation with each other.
Proceedings ArticleDOI
Chaff: engineering an efficient SAT solver
TL;DR: The development of a new complete solver, Chaff, is described which achieves significant performance gains through careful engineering of all aspects of the search-especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy.
Proceedings ArticleDOI
Efficient conflict driven learning in a boolean satisfiability solver
TL;DR: This paper generalizes various conflict driven learning strategies in terms of different partitioning schemes of the implication graph to re-examine the learning techniques used in various SAT solvers and propose an array of new learning schemes.
Journal ArticleDOI
Hybrid metaheuristics in combinatorial optimization: A survey
TL;DR: A survey of some of the most important lines of hybridization of metaheuristics with other techniques for optimization, which includes, for example, the combination of exact algorithms and meta heuristics.
Journal ArticleDOI
Exploring relaxation induced neighborhoods to improve MIP solutions
TL;DR: Two new approaches to exploring interesting, domain-independent neighborhoods in MIP are considered, the more effective of the two, which is called Relaxation Induced Neighborhood Search (RINS), constructs a promising neighborhood using information contained in the continuous relaxation of the MIP model.
References
More filters
Book
Tabu Search
Fred Glover,Manuel Laguna +1 more
TL;DR: This book explores the meta-heuristics approach called tabu search, which is dramatically changing the authors' ability to solve a host of problems that stretch over the realms of resource planning, telecommunications, VLSI design, financial analysis, scheduling, spaceplanning, energy distribution, molecular engineering, logistics, pattern classification, flexible manufacturing, waste management,mineral exploration, biomedical analysis, environmental conservation and scores of other problems.
Journal ArticleDOI
Consistency in Networks of Relations
TL;DR: The primary aim is to provide an accessible, unified framework, within which to present the algorithms including a new path consistency algorithm, to discuss their relationships and the may applications, both realized and potential of network consistency algorithms.
Book
Modern heuristic techniques for combinatorial problems
TL;DR: In this paper, the Lagrangian relaxation and dual ascent tree search were used to solve the graph bisection problem and the graph partition problem, and the traveling salesman problem scheduling problems.
Journal ArticleDOI
Benchmarks for basic scheduling problems
TL;DR: This paper proposes 260 randomly generated scheduling problems whose size is greater than that of the rare examples published, and the objective is the minimization of the makespan.
Book
Introduction To Expert Systems
TL;DR: The third edition of Peter Jackson's book, Introduction to Expert Systems, updates the technological base of expert systems research and embeds those results in the context of a wide variety of application areas.