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 combinatorial-optimization
Search options not deleted
user 9043
For questions about optimization over a discrete solution space.
5
votes
Traveling Salesman: Any "Room" for Derivatives?
Derivatives can be very important
for solving nonconvex problems, especially Mixed Integer NonLinear Programs (MINLP).
A standard approach in Operations Research for solving a nonconvex problem is to
…
- 509
1
vote
Why is Discrete Optimization "Difficult'?
Problems with non-convex feasible regions tend to be hard to solve to a global optimum because hill-climbing algorithms are not guaranteed to work.
A hill climbing algorithm, though typically fast, wi …
- 509
3
votes
Sensitivity Analysis for Traveling Salesman
You can certainly do sensitivity/parametric analysis on the objective function. If you are interested in the effect of changing a single coefficient in a linear objective function to be minimized, e.g …
- 509