Everything about Backmarking

🧭 Start here: a 6-step reading path

1. Read the overview: BackmarkingA 5-minute orientation
2. Pick up a classic book: Dating buttons; a chronology of button types, makers, retailers and their backmarksThe most-reprinted book on the subject
3. Go sideways: BackjumpingA closely related topic
4. Go sideways: Constraint learningA closely related topic

🏆 Landmark papers (most cited)

• No matching papers found.

📚 Books worth reading

• 📕Dating buttons; a chronology of button types, makers, retailers and their backmarksWarren K. Tice · 2002
• 📕American military button makers and dealersWilliam F. McGuinn · 1984
• 📕American military button makers & suppliersWilliam F. McGuinn · 1978

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Backjumping In constraint programming and SAT solving, backjumping (also known as non-chronological backtracking or intelligent backtracking) is an enhancement for…
• Constraint learning In constraint satisfaction backtracking algorithms, constraint learning is a technique for improving efficiency. It works by recording new constraints…
• Local consistency In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables…
• Constrained optimization In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective function…
• 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…
• Hybrid algorithm (constraint satisfaction) Within artificial intelligence and operations research for constraint satisfaction a hybrid algorithm solves a constraint satisfaction problem by the combinatio…
• Look-ahead (backtracking) In backtracking algorithms, look ahead is the generic term for a subprocedure that attempts to foresee the effects of choosing a branching variable to…
• Complexity of constraint satisfaction The complexity of constraint satisfaction is the application of computational complexity theory to constraint satisfaction. It has mainly been studied…