Analysis of Mixed Korean Documents Using the Branch and Bound Algorithm Based on DP Matching

Author： Sim D-G.   Ham Y.K.   Kim I.K.   Park R-H.  

Publisher： Academic Press

ISSN： 1077-3142

Source： Computer Vision and Image Understanding, Vol.71, Iss.3, 1998-09, pp. : 373-384

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering

By Aloise Daniel   Hansen Pierre  

Journal of Global Optimization, Vol. 49, Iss. 3, 2011-03 ,pp. : 449-465

Springer Publishing Company

Access to resources Recommend Favorite

An interior-point Benders based branch-and-cut algorithm for mixed integer programs

By Naoum-Sawaya Joe   Elhedhli Samir  

Annals of Operations Research, Vol. 210, Iss. 1, 2013-11 ,pp. : 33-55

Springer Publishing Company

Access to resources Recommend Favorite

A Branch-and-Bound Algorithm for Concave Network Flow Problems

By Fontes Dalila   Hadjiconstantinou Eleni   Christofides Nicos  

Journal of Global Optimization, Vol. 34, Iss. 1, 2006-01 ,pp. : 127-155

Springer Publishing Company

Access to resources Recommend Favorite

A Branch and Bound algorithm for the minimax regret spanning arborescence

By Conde Eduardo  

Journal of Global Optimization, Vol. 37, Iss. 3, 2007-03 ,pp. : 467-480

Springer Publishing Company

Access to resources Recommend Favorite

A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking

By Ronconi Débora  

Annals of Operations Research, Vol. 138, Iss. 1, 2005-09 ,pp. : 53-65

Springer Publishing Company

Access to resources Recommend Favorite