2 articles for “Branch-and-Bound Algorithms”

Set a search alert

Research ArticleOpen accessIn the keywordsApplications of Parallel Computing for Facility Location-Transportation Problems for Disaster ResponseChansiri Singhtaun, Suriya NatsupakpongThis study extends the capability and increases the performance of a traditional Branch and Bound (BB) algorithm to solve Facility Location-Transportation problems for Disaster Response (FLTDR) using parallel computing. A Two-Stage Branch and Bound (TBB) algorithm was developed to support two parallel computing approaches. This algorithm divides problems into two small sub-problems, which are a facility location sub-problem and a … …Journal of Computer Science, Vol. 11, Issue 4 · 3 Jun 2015 · 6,654 accessesView PDF Cite

Research ArticleOpen accessIn the abstractComparison of Exact Algorithms for Rectilinear Distance Single-Source Capacitated Multi-Facility Weber ProblemsChansiri Singhtaun, Peerayuth CharnsethikulProblem statement: The objective of this study is to develop efficient exact algorithms for a single source capacitated multi-facility location problem with rectilinear distance. This problem is concerned with locating m capacitated facilities in the two dimensional plane to satisfy the demand of n customers with minimum total transportation cost which is proportional to the rectilinear distance between the facilities … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,524 accessesView PDF Cite