Automatic generation of dominance breaking nogoods for a class of constraint optimization problems

Cites Work

Unnamed Item
Unnamed Item
An enhanced branch-and-bound algorithm for the talent scheduling problem
Exploiting subproblem dominance in constraint programming
Philosophy of the MiniZinc challenge
Optimal rectangle packing
On implementing symmetry detection
A new dominance procedure for combinatorial optimization problems
Consistency in networks of relations
Constraint-based scheduling: Applying constraint programming to scheduling problems.
Progress towards the Holy Grail
Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints
Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
Introducing global constraints in CHIP
Propagation via lazy clause generation
Clause vivification by unit propagation in CDCL SAT solvers
A constraint programming approach to electric vehicle routing with time windows
Explaining circuit propagation
Dominance breaking constraints
A method for detecting symmetries in constraint models and its generalisation
In pursuit of the Holy Grail
The complexity of constraint satisfaction revisited
Pruning Moves
Solving Talent Scheduling with Dynamic Programming
An Automatic Method of Solving Discrete Programming Problems
Automatic Detection of Variable and Value Symmetries
Automatically Exploiting Subproblem Equivalence in Constraint Programming
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
P-Complete Approximation Problems
The Power of Dominance Relations in Branch-and-Bound Algorithms
Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
Recent Advances in Constraints
Principles and Practice of Constraint Programming – CP 2003
Recent Advances in Constraints
A new heuristic and dominance relations for no-wait flowshops with setups

This page was built for publication: Automatic generation of dominance breaking nogoods for a class of constraint optimization problems