Skip to content

A pratical application of a branch and bound algorithm to search for the optimal site (minimum cost & maximum reach) to place a train station in a populated matrix

Notifications You must be signed in to change notification settings

migueldiascoelho/BranchAndBound

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 

About

A pratical application of a branch and bound algorithm to search for the optimal site (minimum cost & maximum reach) to place a train station in a populated matrix

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages