Optimierungsroutine für rechenaufwendige Systeme
Multiobjective Mixed-Integer Branch-and-Bound Algorithm
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 algorithms are implemented in sequential variant. SPMD method is used in parallel implementation.
Implementation of Simplex Algorithm and Branch & Bound Algorithm
Branch and Bound algorithm implemented as project for optimization course EA044.
Add a description, image, and links to the branch-and-bound topic page so that developers can more easily learn about it.
To associate your repository with the branch-and-bound topic, visit your repo's landing page and select "manage topics."