swMATH21238MaRDI QIDQ33049FDOQ33049
Author name not available (Why is that?)
Official website: https://link.springer.com/article/10.1023%2FA%3A1009818401322
Cited In (34)
- 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
- Title not available (Why is that?)
- Real-time solving of computationally hard problems using optimal algorithm portfolios
- CLAIRE
- EasyLocal++
- LocalSolver
- CliffMath
- CliffSymNil
- CliffOC
- FlatZinc
- Oz
- EnvyMyCar
- Localizer++
- bc-opt
- DragonBreath
- OPL
- ToOLS
- 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
- Integrating operations research in constraint programming
- Maintaining longest paths incrementally
- Essence: A constraint language for specifying combinatorial problems
- Generic incremental algorithms for local search
- Title not available (Why is that?)
- Integrating operations research in constraint programming
- Model checking spatial logics for closure spaces
- Maintaining longest paths incrementally
- Control abstractions for local search
- 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
This page was built for software: Localizer
