2976 search results - page 29 / 596 » On the bounded integer programming |
DISOPT
2008
13 years 8 months ago
2008
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
MOR
2008
13 years 8 months ago
2008
We consider the following problem: Given a rational matrix A Qm
SIAMJO
2008
13 years 8 months ago
2008
We propose a new class of stochastic integer programs whose special features are dominance constraints induced by mixed-integer linear recourse. For these models, we establish clo...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
CCO
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...