#

branch-and-bound

Here are 250 public repositories matching this topic...

Coac / MagicSquare

Generate valid Magic square through branch and bound algorithm

multithreading magic-square branch-and-bound

Updated Nov 5, 2016
Java

riksameidy / Knapsack_Problem

Knapsack Problem Solved Using Brute-Force, Backtrack and Branch and Bound Method for Algorithm Analysis Course in Telkom University

brute-force knapsack-problem branch-and-bound backtracking-algorithm algorithm-analysis-practice

Updated Nov 26, 2016
Java

nathanchrs / tsp-bb

Branch and bound solver for the travelling salesman problem, written in Python

branch-and-bound travelling-salesman-problem

Updated Apr 6, 2017
Python

deryrahman / if2211-tsp-branch-and-bound

Travel Salesman Problem using Branch and Bound Algorithm, from IF2211: Algorithmic Strategy

tsp branch-and-bound

Updated Apr 6, 2017
Python

abhishekgupta-1 / Parallel-Computing-Assignment

OpenMP and MPI solutions for integer programming problems knapsack and travelling salesman problem using branch and bound technique

openmp mpi-library knapsack-problem branch-and-bound tsp-problem

Updated Apr 19, 2017
C

galinaalperovich / PESP

PESP is a Periodic Timetable combinatorial optimization problem. This project considers PESP of different sizes with Branch and Bound and Genetic algorithm.

python genetic-algorithm branch-and-bound combinatorial-optimization scheduling-algorithms

Updated May 13, 2017
Python

pc2 / coldboot

Hardware Accelerated Cold-Boot Attacks

fpga aes branch-and-bound cold-boot maxeler instance-specific-computing work-stealing

Updated Jul 11, 2017
C++

anderson-uchoa / INF-2926-T2

2st Implementation Work - Design and Analysis of Algorithms 2017.1 - Master in Informatics - PUC-Rio

mst branch-and-bound capmst

Updated Jul 17, 2017
Java

rayandrew / branchbound

Branch and bound implementation in Java with Swing GUI

java algorithm tsp swing-gui branch-and-bound

Updated Aug 23, 2017
Java

fknop / knapsack

Various 1/0 Knapsack implementations in Kotlin

kotlin greedy brute-force dynamic-programming implementation knapsack-problem knapsack branch-and-bound

Updated Sep 26, 2017
Kotlin

jasnap / philogenetic_trees

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.

matlab parallel branch-and-bound scoring-algorithm exhaustive-search fitch-scoring-algorithm bound-search philogenetic-trees maximum-parsimony

Updated Oct 2, 2017
MATLAB

Kirill380 / VacuumCleanerWorld

javascript genetic-algorithm pathfinding greedy-algorithm branch-and-bound randomized-algorithm

Updated Oct 13, 2017
JavaScript

ReadyPlayer2 / TSP

Java Travelling Salesman Problem (3 implementations)

java bruteforce branch-and-bound travelling-salesman-problem

Updated Oct 16, 2017
Java

ankitbit / Operations_Research

optimization optimization-tools operations-research simplex-algorithm branch-and-bound cutting-planes primal-dual

Updated Nov 22, 2017
AMPL

b1sakher / Using-optimisation-methods-to-solve-the-Knap-sack-Problem

The optimisation methods used are : Brute force, Basic branch and bound, Advanced branch and bound, Dynamic programming

brute-force dynamic-programming optimisation optimisation-algorithms knapsack branch-and-bound

Updated Dec 7, 2017
Jupyter Notebook

donfaq / LP_max_clique

Implementation of branch and bound algorithm for maximum clique problem with cplex

algorithms graph cplex branch-and-bound clique lp-problem maximum-clique

Updated Dec 23, 2017
Python

RafaelGoncalves8 / branch-and-bound

Branch and Bound algorithm implemented as project for optimization course EA044.

optimization octave integer-programming branch-and-bound

Updated Dec 29, 2017
MATLAB

tier2novelist / TSP-BB-ts

Solve TSP in Branch and Bound approach, using TypeScript

typescript tsp branch-and-bound tsp-solver

Updated Jan 19, 2018
TypeScript

huyvohcmc / 8-puzzle

Java program to solve the 8 puzzle problem using branch and bound algorithm.

artificial-intelligence search-algorithm 8-puzzle branch-and-bound

Updated Feb 22, 2018
Java

afurculita / IP-BranchAndBound

Java implementation of a total unimodularity based branch and bound method for boolean integer programming

integer-programming branch-and-bound 3-sat

Updated Mar 4, 2018
Java

Improve this page

Add a description, image, and links to the branch-and-bound topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the branch-and-bound topic, visit your repo's landing page and select "manage topics."