8 search results - page 1 / 2 » Fast Integer Programming in Fixed Dimension |
63
Voted
ESA
2003
Springer
15 years 2 months ago
2003
Springer
53
Voted
MOR
2008
14 years 9 months ago
2008
We consider the following problem: Given a rational matrix A Qm
IPCO
2010
14 years 7 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
CPC
2000
14 years 9 months ago
2000
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral ve...
93
Voted
COCOA
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...