15 search results - page 1 / 3 » BDDs in a Branch and Cut Framework |
WEA
2005
Springer
13 years 11 months ago
2005
Springer
ICFEM
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
CCO
2001
Springer
13 years 10 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
ISBI
2011
IEEE
12 years 10 months ago
2011
IEEE
Segmentation of tree-like structure within medical imaging modalities, such as x-ray, MRI, ultrasound, etc., is an important step for analyzing branching patterns involved in many...
AUSSOIS
2001
Springer
13 years 10 months ago
2001
Springer
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...