Super solutions in constraint programming
From MaRDI portal
Recommendations
- Constrained problems via sub-supersolution
- Supermodularity on chains and complexity of maximum constraint satisfaction
- Supermodular programming on finite lattices
- Supermodular programming on lattices
- Exploiting subproblem dominance in constraint programming
- A synthesis of constraint satisfaction and constraint solving
- scientific article; zbMATH DE number 1225858
Cited in
(12)- Supermodular programming on lattices
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems
- Super solutions of random \((3 + p)\)-SAT
- Complexity study for the robust stable marriage problem
- Super solutions of random instances of satisfiability
- Reformulation based MaxSat robustness
- A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming
- On the lower bounds of \((1, 0)\)-super solutions for random \(k\)-SAT
- Multiconsistency and Robustness with Global Constraints
- Super solutions for combinatorial auctions
- Constraint solving in uncertain and dynamic environments: A survey
- Multiconsistency and robustness with global constraints
This page was built for publication: Super solutions in constraint programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713870)