Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

COCOA
2008
Springer

favoriteEmaildiscussreport

174views Discrete Geometry» more COCOA 2008»

Automatic Generation of Symmetry-Breaking Constraints

13 years 5 months ago

Automatic Generation of Symmetry-Breaking Constraints

Download www.lix.polytechnique.fr

Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for ﬁnding elements of the permutation group of solution symmetries, and two diﬀerent types of symmetry-breaking constraints to eliminate these symmetries at the modelling level. We discuss some preliminary computational results.

Leo Liberti

Real-time Traffic

Branch-and-Bound Based Solution | COCOA 2008 | Discrete Geometry | Integer Linear Programs | Solution Symmetries |

claim paper

Related Content

» Automatic Detection of Variable and Value Symmetries

» Breaking InstanceIndependent Symmetries in Exact Graph Coloring

» Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Te...

» Generating Optimal Stowage Plans for Container Vessel Bays

» Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise

» Automatic Generation of Redundant Models for Permutation Constraint Satisfaction Problems

» Automatic Generation of Propagation Rules for Finite Domains

» Automatic Generation of CHR Constraint Solvers

» Automatic Test Data Generation Using Constraint Solving Techniques

Post Info
More Details (n/a)

Added	08 Nov 2010
Updated	08 Nov 2010
Type	Conference
Year	2008
Where	COCOA
Authors	Leo Liberti

Comments (0)