Forum : Toulbar2 New release : 0.9.5

Posté par: Allouche david
Date: 04/07/2012 17:24
Résumé:Toulbar2 New release : 0.9.5
Projet:ToulBar2

Toulbar2 0.9.5 is now available :

- * Features :
- ***********
- refactoring of code allowing to add global decomposable cost function, including new constraint : weighteid among , weighted sum global constraint
- new option -nopre to desactivate all preprocessing options
- sort domains based on unary costs *** works only for binary wcsp problem files ***
- avoid too many messages especially new solutions by using a negative verbosity level
- avoid to many messages especially in BTD-like methods using negative verbosity
- specific code for QTLmap (check treewidth value and abort if too high)
- allows variable elimination during search for probabilistic inference (option -logz)
- simple upper bounding (remove subtree if less than 0.001 improvement) scheme for probabilistic inference (option -logz)
- benchmarking : new perl and cmake script for benchmarking management
- option -t=[integer]
- when giving a solution file as input (*.sol) with additional option -x then the search starts with an initial upper bound given by the solution and value heuristic tries solution values first.
- branch and bound with restart at each solution (option -L=0).
- new cost function wregular
- detect and exploit ternary functional constraints
- new option -static for using a static variable ordering heuristic (the same as used by DAC)
- problem format .qpbo for quadratic pseudo-Boolean optimization (unconstrained quadratic programming) with variable domain {0,1} or {1,-1} and minimization/maximization.
- new problem format .qpbo for quadratic pseudo-Boolean optimization (unconstrained quadratic programming)
- sigma-gcc added in order to give different cost penalities proportional to (upper or lower) bounds violation.
- hidden feature for CSP counting with DFBB and restricted search depth

- documentation addons
- ************************
- wregular , wsum , wamoung woverlap description
- documentation corrections
- avoid too many messages especially new solutions by using a negative verbosity level
- problem format .qpbo for quadratic pseudo-Boolean optimization (unconstrained quadratic programming) with variable domain {0,1} or {1,-1} and minimization/maximization.
- add qpbo example in validation/default/

Dernières annonces

Pas d'annonce
Surveiller ce forum | Commencer une nouvelle discussion Commencer une nouvelle discussion
Powered By FusionForge