1707 search results - page 9 / 342 » Early Integer Programming |
CPAIOR
2005
Springer
14 years 3 months ago
2005
Springer
Creating good integer programming formulations had, as a basic axiom, the rule “Find formulations with tighter linear relaxations”. This rule, while useful when using unsophist...
SIAMJO
2010
13 years 4 months ago
2010
Abstract. We investigate integer programs containing monomial constraints of the type Q iI xi i = b. Due to the number-theoretic nature of these constraints, standard methods based...
DIMVA
2006
13 years 11 months ago
2006
Incomplete or improper input validation is one of the major sources of security bugs in programs. While traditional approaches often focus on detecting string related buffer overfl...
DISOPT
2008
13 years 10 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 9 months ago
2008
We consider the following problem: Given a rational matrix A Qm