Cited in
(46)- Tractability in constraint satisfaction problems: a survey
- Solving the crop allocation problem using hard and soft constraints
- New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
- Fuzzy constraint satisfaction problem for model-based image interpretation
- The power of linear programming for general-valued CSPs
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
- MiniBrass: soft constraints for MiniZinc
- Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction
- Leveraging cluster backbones for improving MAP inference in statistical relational models
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- Modularity-based decompositions for valued CSP
- DARN!
- OptSAT
- MaxSolver
- NumberJack
- OPIUM
- FASoft
- SLIDE
- AtMostNValue
- MSUnCore
- G12
- ComputeTW
- ROTOR
- Alchemy
- Approximate counting in SMT and value estimation for probabilistic programs
- DAOOPT
- mplp2
- OpenGM
- Osprey
- MiniSearch
- MiniBrass
- YIELDS
- LoMRF
- RockIt
- SPFlow
- Xeggora
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
- Combining restarts, nogoods and bag-connected decompositions for solving csps
- Tractability-preserving transformations of global cost functions
- Triangle-based consistencies for cost function networks
- Iterative and core-guided maxsat solving: a survey and assessment
- Models and solution techniques for frequency assignment problems
- Computational protein design as an optimization problem
- Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
- Variable neighborhood search for graphical model energy minimization
- Multiple-choice knapsack constraint in graphical models
This page was built for software: ToulBar2
