Cited in
(38)- Localizer: A Modeling Language for Local Search
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
- Differentiable Invariants
- Finding the right hybrid algorithm -- a combinatorial meta-problem
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
- Contraint-based combinators for local search
- iOpt
- NP-SPEC
- CLAIRE
- SALSA
- COMET
- EasyLocal++
- LocalSolver
- CliffMath
- CliffSymNil
- CliffOC
- FlatZinc
- Oz
- EnvyMyCar
- Localizer++
- bc-opt
- DragonBreath
- OPL
- ToOLS
- Real-time solving of computationally hard problems using optimal algorithm portfolios
- scientific article; zbMATH DE number 7453149 (Why is no real title available?)
- A unified framework for partial and hybrid search methods in constraint programming
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- Maintaining longest paths incrementally
- Integrating operations research in constraint programming
- Essence: A constraint language for specifying combinatorial problems
- Generic incremental algorithms for local search
- scientific article; zbMATH DE number 1406244 (Why is no real title available?)
- Integrating operations research in constraint programming
- Model checking spatial logics for closure spaces
- Control abstractions for local search
- Maintaining longest paths incrementally
This page was built for software: Localizer
