scientific article; zbMATH DE number 2084699
From MaRDI portal
Publication:4475624
zbMath1067.68631MaRDI QIDQ4475624
Stefan Schamberger, Torsten Fahle, Meinolf Sellmann
Publication date: 9 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2239/22390093.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (34)
A supervised learning-driven heuristic for solving the facility location and production planning problem ⋮ Symmetry breaking constraints for value symmetries in constraint satisfaction ⋮ Symmetry definitions for constraint satisfaction problems ⋮ The green capacitated multi-item lot sizing problem with parallel machines ⋮ Predicting and detecting symmetries in FOL finite model search ⋮ Towards breaking more composition symmetries in partial symmetry breaking ⋮ Orbitopal fixing ⋮ Dominance rules in combinatorial optimization problems ⋮ Local Symmetry Breaking During Search in CSPs ⋮ Breaking Symmetry of Interchangeable Variables and Values ⋮ Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance ⋮ Exploiting subproblem dominance in constraint programming ⋮ Packing and partitioning orbitopes ⋮ Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver ⋮ Generating custom propagators for arbitrary constraints ⋮ A stochastic programming approach to determine robust delivery profiles in area forwarding inbound logistics networks ⋮ Design of financial CDO squared transactions using constraint programming ⋮ A CSP search algorithm with responsibility sets and kernels ⋮ Enhancing set constraint solvers with lexicographic bounds ⋮ An effective greedy heuristic for the social golfer problem ⋮ A branch-and-bound algorithm for hard multiple knapsack problems ⋮ Modelling and solving English peg solitaire ⋮ In search of balance: the challenge of generating balanced Latin rectangles ⋮ Static and dynamic structural symmetry breaking ⋮ Solving Kirkman's schoolgirl problem in a few seconds ⋮ Symmetry breaking revisited ⋮ Searching for mutually orthogonal Latin squares via integer and constraint programming ⋮ A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling ⋮ Dynamic structural symmetry breaking for constraint satisfaction problems ⋮ \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver ⋮ Memetic collaborative approaches for finding balanced incomplete block designs ⋮ Lightweight dynamic symmetry breaking ⋮ Symmetries, almost symmetries, and lazy clause generation ⋮ A method for detecting symmetries in constraint models and its generalisation
This page was built for publication:
