 |
|
|
|
|
 |
 |
|
A Brief Introduction to Integer Linear Programming in Mathematica
|
|
|
|
|
|
| Organization: | Wolfram Research, Inc. |
|
|
|
|
|
|
2006 Wolfram Technology Conference
|
|
|
|
|
|
Champaign IL
|
|
|
|
|
|
In this discussion I will show how lattice reduction and branch-and-bound methods may be used in tandem to solve Frobenius instance problems. The same ideas apply to other aspects of finding Frobenius numbers, as well as other problems in integer linear programming. Much of this is not implemented under the hood in Mathematica functions FindInstance, Reduce, and Minimize.
|
|
|
|
|
|
|
|
|
|
|
|
integer linear programming, discrete optimization, constraint satisfaction problems
|
|
|
 |
|
|
| TechConf2006_ilp_talk.nb (515.7 KB) - Mathematica Notebook [for Mathematica 6.0] |
|
|
For the newest resources, visit Wolfram Repositories and Archives »
