Permutation Problems and Channelling Constraints
From MaRDI portal
Recommendations
- The unit-capacity constrained permutation problem
- Convex relaxations for permutation problems
- scientific article; zbMATH DE number 26585
- Convex solution of a permutation problem
- scientific article; zbMATH DE number 2084742
- On the question of the optimization of permutations in the problem with dynamic constraints
- A Gale-Berlekamp permutation-switching problem
- scientific article; zbMATH DE number 3865283
Cited in
(13)- Evaluating ASP and commercial solvers on the CSPLib
- Exploiting functional dependencies in declarative problem specifications
- The unit-capacity constrained permutation problem
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- Global domain views for expressive and cross-domain constraint programming
- Automated reformulation of specifications by safe delay of constraints
- Compiling problem specifications into SAT
- Automatic generation of redundant models for permutation constraint satisfaction problems
- scientific article; zbMATH DE number 2084742 (Why is no real title available?)
- SampleSearch: importance sampling in presence of determinism
- scientific article; zbMATH DE number 2243353 (Why is no real title available?)
- Redundant modeling in permutation weighted constraint satisfaction problems
- On the separability of subproblems in Benders decompositions
This page was built for publication: Permutation Problems and Channelling Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996177)
