Sciweavers

7 search results - page 1 / 2
» Parametric Integer Programming in Fixed Dimension
Sort
View
MOR
2008
94views more  MOR 2008»
14 years 10 months ago
Parametric Integer Programming in Fixed Dimension
We consider the following problem: Given a rational matrix A Qm
Friedrich Eisenbrand, Gennady Shmonin
FOCS
1992
IEEE
15 years 2 months ago
Maximizing Non-Linear Concave Functions in Fixed Dimension
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...
Sivan Toledo
IPCO
2010
153views Optimization» more  IPCO 2010»
14 years 8 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
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...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
97
Voted
IPPS
1998
IEEE
15 years 2 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
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 ...
Peter R. Cappello, Ömer Egecioglu