Everything about Min-conflicts algorithm

🧭 Start here: a 6-step reading path

1. Read the overview: Min-conflicts algorithmA 5-minute orientation
2. Read the landmark paper: Disjoint task allocation algorithms for MIN machines with minimal conflictsCited 1 times
3. Go sideways: Constraint satisfaction problemA closely related topic
4. Go sideways: Constraint programmingA closely related topic

🏆 Landmark papers (most cited)

• Disjoint task allocation algorithms for MIN machines with minimal conflicts

  Chansu Yu, C.R. Das · 1995 · IEEE Transactions on Parallel and Distributed Systems · 1 citations

📚 Books worth reading

Open Library didn't respond; try again in a moment.

🔗 Related topics

• Constraint satisfaction problem Constraint satisfaction problems (CSPs) are mathematical questions defined as a set of objects whose state must satisfy a number of constraints or limitations…
• Constraint programming Constraint programming (CP) is a paradigm for solving combinatorial problems that draws on a wide range of techniques from artificial intelligence, computer…
• Guided local search Guided local search is a metaheuristic search method. A meta-heuristic method is a method that sits on top of a local search algorithm to change its behavior…
• Local search (constraint satisfaction) In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. It is based on iteratively improving an assignment…
• Constrained optimization In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective function…
• Constraint satisfaction In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution through a set of constraints that impose…
• Interchangeability algorithm In computer science, an interchangeability algorithm is a technique used to more efficiently solve constraint satisfaction problems (CSP). A CSP is a mathematic…
• Weighted constraint satisfaction problem In artificial intelligence and operations research, a Weighted Constraint Satisfaction Problem (WCSP), also known as Valued Constraint Satisfaction Problem…