\input zb-basic
\input zb-ioport
\iteman{io-port 06107379}
\itemau{Pfeuffer, Frank; Stiglmayr, Michael; Klamroth, Kathrin}
\itemti{Discrete and geometric branch and bound algorithms for~medical image registration.}
\itemso{Ann. Oper. Res. 196, 737-765 (2012).}
\itemab
Summary: Aiming at the development of an exact solution method for registration problems, we present two different Branch $\&$ Bound algorithms for a mixed integer programming formulation of the problem. The first B$\&$B algorithm branches on binary assignment variables and makes use of an optimality condition that is derived from a graph matching formulation. The second, geometric B$\&$B algorithm applies a geometric branching strategy on continuous transformation variables. The two approaches are compared for synthetic test examples as well as for 2-dimensional medical data. The results show that medium sized problem instances can be solved to global optimality in a reasonable amount of time.
\itemrv{~}
\itemcc{}
\itemut{}
\itemli{doi:10.1007/s10479-010-0760-8}
\end