Mathematica 9 is now available

Wolfram Library Archive


Courseware Demos MathSource Technical Notes
All Collections Articles Books Conference Proceedings
Title Downloads

Integer Linear Programming, Frobenius Instances, and Frobenius Numbers
Author

Daniel Lichtblau
Organization: Wolfram Research, Inc.
Conference

JMM 2008
Conference location

San Diego, California
Description

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
Subjects

*Mathematics > Discrete Mathematics > Combinatorics
*Mathematics > Number Theory
Keywords

Frobenius numbers, Frobenius instance problem, postage stamp problem, change making problem, integer linear programming
URL

http://www.ams.org/amsmtgs/2109_intro.html
Downloads Download Wolfram CDF Player

Download
JMM2008_ILP_talk.pdf (60.8 KB) - PDF Document
Download
JMM2008_ILP_talk.nb (123.9 KB) - Mathematica Notebook