2008-06-01
Lattice reformulation of integer programming problems
Publication
Publication
We discuss how to use the structure of lattices to reformulate and solve integer programming problems. We take a closer look at integer knapsack problems and illustrate how it is possible to use the structure of lattices to prove properties of certain classes of knapsack problems, and how these properties can be used in designing practically efficient algorithms.
| Additional Metadata | |
|---|---|
| , | |
| A.M.S. | |
| M. Beck , C. Haase , B. Reznick , M. Vergne , V. Welker , R. Yoshida | |
| Contemporary mathematics | |
| Decision Support Systems for Logistic Networks and Supply Chain Optimization , Discrete, interactive & algorithmic mathematics, algebra and number theory , Algorithmic Optimization Discretization | |
| Organisation | Networks and Optimization |
|
Aardal, K. (2008). Lattice reformulation of integer programming problems . In M. Beck, C. Haase, B. Reznick, M. Vergne, V. Welker, & R. Yoshida (Eds.), Contemporary Mathematics (pp. 1–14). A.M.S. |
|