SALSA
From MaRDI portal
SALSA Q15200
Cited in
(45)- Resource allocation in a mobile telephone network: A constructive repair algorithm
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Contraint-based combinators for local search
- Programming constraint services. High-level programming of standard and new constraint services
- A modeling layer for constraint-programming libraries
- On-line resources allocation for ATM networks with rerouting
- Combining local and global search in a constraint programming environment
- Nondeterministic control for hybrid search
- Logic Based Program Synthesis and Transformation
- Logic programming in the context of multiparadigm programming: the Oz experience
- A microkernel architecture for constraint programming
- Control abstractions for local search
- Maintaining longest paths incrementally
- Maintaining longest paths incrementally
- iOpt
- Nondeterministic Control for Hybrid Search
- CLAIRE
- COMET
- CHIP
- KLIC
- EasyLocal++
- Choco
- Oz
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Constraint and integer programming in OPL
- Localizer++
- bc-opt
- DragonBreath
- Localizer
- Modeler
- OPL
- ToOLS
- CBack
- CLAIRE: combining sets, search and rules to better express algorithms
- Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain
- Integrating operations research in constraint programming
- A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints
- Integrating operations research in constraint programming
- Finding the right hybrid algorithm -- A combinatorial meta-problem
- Principles and Practice of Constraint Programming – CP 2004
- Search combinators
- Finding the right hybrid algorithm -- a combinatorial meta-problem
- Solving constraint optimization problems from CLP-style specifications using heuristic search techniques
- A decomposition-based implementation of search strategies
- Using constraint-based operators to solve the vehicle routing problem with time windows
This page was built for software: SALSA
