Local search with constraint propagation and conflict-based heuristics
From MaRDI portal
Publication:1606115
DOI10.1016/S0004-3702(02)00221-7zbMATH Open1015.68056OpenAlexW2095435811MaRDI QIDQ1606115FDOQ1606115
Authors: Narendra Jussien, Olivier Lhomme 
Publication date: 31 July 2002
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00221-7
Recommendations
Cites Work
- A Computational Study of the Job-Shop Scheduling Problem
- Consistency in networks of relations
- Open Shop Scheduling to Minimize Finish Time
- Title not available (Why is that?)
- Benchmarks for basic scheduling problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Adjustment of heads and tails for the job-shop problem
- Constraint propagation with interval labels
- A branch \(\&\) bound algorithm for the open-shop problem
- A tabu search algorithm for the open shop problem
- Competitive genetic algorithms for the open-shop scheduling problem
- Title not available (Why is that?)
- A tabu search algorithm for the open shop scheduling problem
- A new lower bound for the open-shop problem
- Title not available (Why is that?)
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
- An algebraic graphical model for decision with uncertainties, feasibilities, and utilities
Cited In (34)
- Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
- Title not available (Why is that?)
- Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem
- The path-repair algorithm
- Using local search to speed up filtering algorithms for some NP-hard constraints
- Combining constraint programming and local search for job-shop scheduling
- Explanation-based large neighborhood search
- Explaining the \texttt{cumulative} propagator
- Heuristic-based backtracking relaxation for propositional satisfiability
- Exploiting relaxation in local search for LABS
- Logic Programming
- Meta-heuristics and artificial intelligence
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Revisiting constraint-directed search
- Switching among solvers: collaborative algorithms with parameter control
- A general approach for constraint solving by local search
- Space and time allocation in a shipyard assembly hall
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- About the choice of the variable to unassign in a decision repair algorithm
- Using Local Search for Guiding Enumeration in Constraint Solving
- A framework for constructing complete algorithms based on local search
- Title not available (Why is that?)
- The Relation Between Complete and Incomplete Search
- Compiling finite linear CSP into SAT
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
- Identifying and exploiting problem structures using explanation-based constraint programming
- Integrating operations research in constraint programming
- Constraint solving in uncertain and dynamic environments: A survey
- Using Tabu Search in CSPs
- Inferring Variable Conflicts for Local Search
- Shift-and-propagate
- Methods and Applications of Artificial Intelligence
Uses Software
This page was built for publication: Local search with constraint propagation and conflict-based heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606115)
