Parallel Local Search in Comet
From MaRDI portal
Recommendations
Cited in
(23)- Parallel and distributed local search in COMET
- Parallel local search
- Model-driven visualizations of constraint-based local search
- Generic incremental algorithms for local search
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- Modeling with metaconstraints and semantic typing of variables
- Parallel constraint-based local search on the Cell/BE multicore architecture
- Distributed Constraint-Based Local Search
- LS(graph): a constraint-based local search for constraint optimization on trees and paths
- Search combinators
- Generating local search neighborhood with synthesized logic programs
- scientific article; zbMATH DE number 7453149 (Why is no real title available?)
- The weighted grammar constraint
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integrating operations research in constraint programming
- Integrating operations research in constraint programming
- Space and time allocation in a shipyard assembly hall
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- Solving scheduling problems from high-level models
- Control abstractions for local search
- A GRASP approach for the extended car sequencing problem
- Global constraint catalogue: past, present and future
- The design of the zinc modelling language
This page was built for publication: Parallel Local Search in Comet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524195)