Finding the right hybrid algorithm -- a combinatorial meta-problem

MaRDI QIDQ2741387zbMATH OpenFDO

Authors Joachim Schimpf, Mark Wallace

Publication date 24 September 2001

zbMATH Keywords

benchmark comparisonscombintorial problemsGSAThybrid algorithmlocal search algorithm

Mathematics Subject Classification ID

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

Recommendations

• Finding the right hybrid algorithm -- A combinatorial meta-problem
• scientific article; zbMATH DE number 2159469
• scientific article; zbMATH DE number 2080317
• A generic approach to combining stochastic algorithms with systematic constraint solvers
• Localizer

Cites work

• Localizer: A Modeling Language for Local Search
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Non-systematic search and no-good learning
• Probe backtrack search for minimal perturbation in dynamic scheduling
• SALSA: a language for search algorithms

Cited in

(3)

• Finding the right hybrid algorithm -- A combinatorial meta-problem
• scientific article; zbMATH DE number 2159469 (Why is no real title available?)
• On benchmarking constraint logic programming platforms. Response to Fernández and Hill's ``A comparative study of eight constraint programming languages over the Boolean and finite domains

Describes a project that uses

Uses Software

• Localizer
• SALSA

This page was built for publication: Finding the right hybrid algorithm -- a combinatorial meta-problem

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