2976 search results - page 137 / 596 » On the bounded integer programming |
117
click to vote
ANOR
2008
15 years 2 months ago
2008
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...
150
click to vote
MOR
2000
15 years 2 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
137
click to vote
SPAA
2006
ACM
15 years 8 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
102
click to vote
RTA
2010
Springer
15 years 6 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
119
click to vote
PLDI
2003
ACM
15 years 8 months ago
2003
ACM
We compile Nova, a new language designed for writing network processing applications, using a back end based on integer-linear programming (ILP) for register allocation, optimal b...