Skip to content

/ algorithms

Branch and bound and some problem reductions with java

0 stars 0 forks
Star
Watch
master
2 branches 0 tags
Go to file
Code

Clone with HTTPS

Use Git or checkout with SVN using the web URL.

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
src
 
 
README.md
 
 
SatExpression.txt
 
 
SatExpression2.txt
 
 
SatExpression3.txt
 
 
SatExpression4.txt
 
 
graph.txt
 
 
graph100-1.txt
 
 
graph100-2.txt
 
 
graph100.txt
 
 
graph2.txt
 
 
graph200-1.txt
 
 
graph200-2.txt
 
 
graph200.txt
 
 
graph3.txt
 
 
graph300-1.txt
 
 
graph300-2.txt
 
 
graph300.txt
 
 
graph400-1.txt
 
 
graph400-2.txt
 
 
graph400.txt
 
 
graph500-1.txt
 
 
graph500-2.txt
 
 
graph500.txt
 
 

README.md

algorithms

Branch and bound and some problem reductions with java

Problems solved

  • Independent set (greedy approach)
  • Independent set (Branch and Bound approach)
  • Clique problem
  • SAT

About

Branch and bound and some problem reductions with java

Topics

data-structure-java branch-and-bound problem-solving java algorithms

Resources

Readme

Releases

No releases published

Packages

No packages published

Languages

You can’t perform that action at this time.