|
|
|
|
|
|
 |
 |
|
Integer Linear Programming, Frobenius Instances, and Frobenius Numbers
|
|
|
|
|
|
| Organization: | Wolfram Research, Inc. |
|
|
|
|
|
|
JMM 2008
|
|
|
|
|
|
San Diego, California
|
|
|
|
|
|
Talk given at JMM 2008, session on Frobenius numbers.
I will show how lattice reduction and branch-and-bound methods may be used in tandem to solve Frobenius instance problems. We apply much the same methods to other aspects of finding Frobenius numbers. Moreover the instance solver can be used to give good (as in tight, with high probability) bounds on the Frobenius number, in many cases where the latter computation is intractable with current methods.
Part 1: Review integer linear programming and Frobenius instance solving
Part 2: Show further applications to Frobenius number problem
|
|
|
|
|
|
|
|
|
|
|
|
Frobenius numbers, Frobenius instance problem, postage stamp problem, change making problem, integer linear programming
|
|
|
|
|
|
http://www.ams.org/amsmtgs/2109_intro.html
|
|
|
 |
|
|
| JMM2008_ILP_talk.pdf (60.8 KB) - PDF Document | | JMM2008_ILP_talk.nb (123.9 KB) - Mathematica Notebook |
|
|
|
|
|
|
|
| | | | | |
|
For the newest resources, visit Wolfram Repositories and Archives »
