Name
Abstract | ||
|---|---|---|
IntroductionInteger programming (IP) is concerned with solving linear equations over thenon-negative integers, subject to the requirement that a linear cost function isminimized. We consider families of integer programs where the matrix and thecost function are fixed but the right hand side varies. The algebraic techniqueof Grobner bases provides tools for preprocessing such a family. The result ofthis preprocessing is a test set (in the sense of [13] and [14], x17.3) which allowsthe... |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/3-540-59408-6_57 | IPCO |
Keywords | Field | DocType |
integer programming,bner bases,cost function,linear equations | Discrete mathematics,Algebra,Integer programming,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-59408-6 | 18 | 3.62 |
References | Authors | |
4 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Serkan Hosten | 1 | 65 | 13.64 |
| Bernd Sturmfels | 2 | 926 | 136.85 |