Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with simulated-annealing
Search options not deleted
user 199
For questions about the use of Simulated Annealing (SA) for solving combinatorial problems. SA is a probabilistic metaheuristic that can approximate the global optimum in a large (and usually discrete) search space.
8
votes
Black-box optimization with linear programming?
AFAIK, it depends on the optimization problem under study. As @Kuifje said, black boxes are used when the problem is too complex.
One of the ways to apply simulation-optimization is to use discrete …
- 9,446