A constraint-based local search backend for MiniZinc

DOI10.1007/s10601-015-9184-zzbMath1325.90076OpenAlexW2066265366WikidataQ57574228 ScholiaQ57574228MaRDI QIDQ890003

Jean-Noël Monette, Gustav Björdal, Justin Pearson, Pierre Flener

Publication date: 9 November 2015

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-015-9184-z

zbMATH Keywords

constraint-based local searchMiniZinc

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Progress towards the Holy Grail, Auto-tabling for subproblem presolving in MiniZinc, Unnamed Item, Unnamed Item

Uses Software

• SCIP
• COMET
• ANTLR
• LocalSolver
• MiniZinc
• FlatZinc
• Gecode
• OscaR
• fzn2smt
• Oscar.cbls
• Kangaroo
• OR-tools
• SUNNY

Cites Work

• Unnamed Item
• Unnamed Item
• Philosophy of the MiniZinc challenge
• LocalSolver 1.x: A black-box local-search solver for 0-1 programming
• SCIP: solving constraint integer programs
• Global constraint catalogue: past, present and future
• Automatically improving constraint models in Savile Row
• Combining the scalability of local search with the pruning techniques of systematic search
• Model-driven visualizations of constraint-based local search
• SUNNY: a Lazy Portfolio Approach for Constraint Solving
• An Integrated Solver for Optimization Problems
• Tabu Search—Part I
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Reducibility among Combinatorial Problems
• Scheduling Social Golfers Locally
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2004