The path-repair algorithm

MaRDI QIDQ2741380zbMATH OpenFDO

Authors Narendra Jussien, Olivier Lhomme

Publication date 24 September 2001

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 2166451
• About the choice of the variable to unassign in a decision repair algorithm
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Local search with constraint propagation and conflict-based heuristics
• scientific article; zbMATH DE number 1234562

Cites work

• 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
• Benchmarks for basic scheduling problems
• scientific article; zbMATH DE number 4033125 (Why is no real title available?)
• scientific article; zbMATH DE number 1149402 (Why is no real title available?)
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Non-systematic search and no-good learning
• Open Shop Scheduling to Minimize Finish Time
• Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems

Cited in

(1)

• scientific article; zbMATH DE number 2166451 (Why is no real title available?)

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: The path-repair algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741380)