The following pages link to (Q4475624):
Displaying 35 items.
- Orbitopal fixing (Q408377) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- Exploiting subproblem dominance in constraint programming (Q453591) (← links)
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- Symmetry breaking constraints for value symmetries in constraint satisfaction (Q850460) (← links)
- Symmetry definitions for constraint satisfaction problems (Q850464) (← links)
- Predicting and detecting symmetries in FOL finite model search (Q861703) (← links)
- Packing and partitioning orbitopes (Q925263) (← links)
- Static and dynamic structural symmetry breaking (Q976989) (← links)
- Dynamic structural symmetry breaking for constraint satisfaction problems (Q1037643) (← links)
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver (Q1037644) (← links)
- The green capacitated multi-item lot sizing problem with parallel machines (Q1651651) (← links)
- Towards breaking more composition symmetries in partial symmetry breaking (Q1677433) (← links)
- An effective greedy heuristic for the social golfer problem (Q1761919) (← links)
- Solving Kirkman's schoolgirl problem in a few seconds (Q1774517) (← links)
- Symmetry breaking revisited (Q1774518) (← links)
- In search of balance: the challenge of generating balanced Latin rectangles (Q2011576) (← links)
- A supervised learning-driven heuristic for solving the facility location and production planning problem (Q2140228) (← links)
- Memetic collaborative approaches for finding balanced incomplete block designs (Q2337377) (← links)
- Lightweight dynamic symmetry breaking (Q2342593) (← links)
- Symmetries, almost symmetries, and lazy clause generation (Q2342601) (← links)
- A method for detecting symmetries in constraint models and its generalisation (Q2342650) (← links)
- Generating custom propagators for arbitrary constraints (Q2453695) (← links)
- A stochastic programming approach to determine robust delivery profiles in area forwarding inbound logistics networks (Q2454335) (← links)
- Design of financial CDO squared transactions using constraint programming (Q2454813) (← links)
- A CSP search algorithm with responsibility sets and kernels (Q2454814) (← links)
- Enhancing set constraint solvers with lexicographic bounds (Q2476614) (← links)
- Modelling and solving English peg solitaire (Q2489133) (← links)
- Searching for mutually orthogonal Latin squares via integer and constraint programming (Q2496074) (← links)
- A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling (Q2830948) (← links)
- Local Symmetry Breaking During Search in CSPs (Q3523057) (← links)
- Breaking Symmetry of Interchangeable Variables and Values (Q3523071) (← links)
- Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance (Q3523073) (← links)
- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver (Q5387622) (← links)
- SAT modulo symmetries for graph generation and enumeration (Q6610196) (← links)
