This paper presents a "branch and bound" algorithm for the following problem: given a project consisting of a set of activities partially ordered by a set of precedence restrictions, with each ...

In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide ...

Abstract: Summary & ConclusionsThe objective of the majority of production planning problems is to find the order of jobs on each machine minimizing functions of the jobs’ processing times, such as ...

Abstract: Due to the current growth of e-commerce, route optimization is needed to keep up with the demand and satisfy customer expectations for on time package delivery. This study is conducted to ...

Parallel and sequential algorithms for finding philogenetic trees using Maximum Parsimony. The scoring algorithm used is Fitch scoring algorithm. Exhaustive search and Branch and Bound search ...