 |
|
|
|
|
 |
 |
|
Discrete Optimization in Mathematica 4.2
|
|
|
|
|
|
| Organization: | Wolfram Research, Inc. |
|
|
|
|
|
|
2001 Mathematica Developer Conference
|
|
|
|
|
|
Champaign, IL
|
|
|
|
|
|
Often in optimization problems arise that are discrete in nature. For example, there are the standard problems of integer programming; these are similar to continuous optimization except that one needs to restrict some or all variables to be integer or 0-1 valued. Other examples include assignment problems, set coverings by families of subsets, set splittings, routing problems, and more. We discuss application of Mathematica's numeric optimization technology to such problems in discrete optimization. We will illustrate nutsandbolts details of how to cast problems in a framework that NMinimize can handle and will illustrate with a variety of examples. We will say a bit about tuning considerations.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
 |
|
|
| lichtblau.nb (117.7 KB) - Mathematica Notebook |
|
|
For the newest resources, visit Wolfram Repositories and Archives »
