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.
dilsonpereira/EstimatingOpt
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|