Local search with constraint propagation and conflict-based heuristics
From MaRDI portal
(Redirected from Publication:1606115)
Recommendations
Cites work
- scientific article; zbMATH DE number 4162321 (Why is no real title available?)
- scientific article; zbMATH DE number 1149402 (Why is no real title available?)
- scientific article; zbMATH DE number 2080311 (Why is no real title available?)
- scientific article; zbMATH DE number 2080317 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- A Computational Study of the Job-Shop Scheduling Problem
- A branch \(\&\) bound algorithm for the open-shop problem
- A new lower bound for the open-shop problem
- A tabu search algorithm for the open shop problem
- A tabu search algorithm for the open shop scheduling problem
- Adjustment of heads and tails for the job-shop problem
- An algebraic graphical model for decision with uncertainties, feasibilities, and utilities
- Benchmarks for basic scheduling problems
- Competitive genetic algorithms for the open-shop scheduling problem
- Consistency in networks of relations
- Constraint propagation with interval labels
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Open Shop Scheduling to Minimize Finish Time
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
Cited in
(34)- Inferring Variable Conflicts for Local Search
- Methods and Applications of Artificial Intelligence
- Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
- scientific article; zbMATH DE number 2083802 (Why is no real title available?)
- 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
- Using Local Search for Guiding Enumeration in Constraint Solving
- About the choice of the variable to unassign in a decision repair algorithm
- A framework for constructing complete algorithms based on local search
- scientific article; zbMATH DE number 1670594 (Why is no real title available?)
- The Relation Between Complete and Incomplete Search
- Compiling finite linear CSP into SAT
- Identifying and exploiting problem structures using explanation-based constraint programming
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
- Integrating operations research in constraint programming
- Constraint solving in uncertain and dynamic environments: A survey
- Using Tabu Search in CSPs
- Shift-and-propagate
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)
