In this jupyter notebook, I explain how the optimal solution value of a combinatorial optimization problem can be estimated by means of random solutions. The TSP is used as an example.
-
Notifications
You must be signed in to change notification settings - Fork 0
dilsonpereira/EstimatingOpt
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Statistical estimation of optimal solutions for combinatorial optimization problems
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published