7 search results - page 1 / 2 » Parametric Integer Programming in Fixed Dimension |
MOR
2008
14 years 9 months ago
2008
We consider the following problem: Given a rational matrix A Qm
ESA
2003
Springer
15 years 2 months ago
2003
Springer
FOCS
1992
IEEE
15 years 1 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
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...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...