Breaking Weak Symmetries in Constraint Programming
Constraint programming (CP) is a powerful solving paradigm that is based on inference and search control algorithms and suitable for arbitrary/various NP-hard combinatorial problems beyond linearity. The flexibility of constraints - the working machines of a CP solver - allow a wide range of problem...
Main Author: | |
---|---|
Format: | Others |
Language: | English en |
Published: |
2007
|
Online Access: | https://tuprints.ulb.tu-darmstadt.de/863/1/Diss_WeakSym_RM.pdf Martin, Roland <http://tuprints.ulb.tu-darmstadt.de/view/person/Martin=3ARoland=3A=3A.html> (2007): Breaking Weak Symmetries in Constraint Programming.Darmstadt, Technische Universität, [Online-Edition: http://elib.tu-darmstadt.de/diss/000863 <http://elib.tu-darmstadt.de/diss/000863> <official_url>],[Ph.D. Thesis] |
Internet
https://tuprints.ulb.tu-darmstadt.de/863/1/Diss_WeakSym_RM.pdfMartin, Roland <http://tuprints.ulb.tu-darmstadt.de/view/person/Martin=3ARoland=3A=3A.html> (2007): Breaking Weak Symmetries in Constraint Programming.Darmstadt, Technische Universität, [Online-Edition: http://elib.tu-darmstadt.de/diss/000863 <http://elib.tu-darmstadt.de/diss/000863> <official_url>],[Ph.D. Thesis]