1707 search results - page 64 / 342 » Early Integer Programming |
INFORMS
2008
14 years 9 months ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
ISCA
1998
IEEE
15 years 2 months ago
1998
IEEE
This paper examines the performance of desktop applications running on the Microsoft Windows NT operating system on Intel x86 processors, and contrasts these applications to the p...
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
LICS
1997
IEEE
15 years 2 months ago
1997
IEEE
In this paper, we incorporate a representation of the non-negative extended real numbers based on the composition of linear fractional transformations with nonnegative integer coe...