Sciweavers

2976 search results - page 14 / 596
» On the bounded integer programming
Sort
View
DISOPT
2008
85views more  DISOPT 2008»
13 years 7 months ago
How tight is the corner relaxation?
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
Matteo Fischetti, Michele Monaci
EJC
2011
13 years 2 months ago
Bounds on generalized Frobenius numbers
Let N ≥ 2 and let 1 < a1 < · · · < aN be relatively prime integers. The Frobenius number of this N-tuple is defined to be the largest positive integer that has no re...
Lenny Fukshansky, Achill Schürmann
DATE
1998
IEEE
93views Hardware» more  DATE 1998»
13 years 11 months ago
Exact and Approximate Estimation for Maximum Instantaneous Current of CMOS Circuits
We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact so...
Yi-Min Jiang, Kwang-Ting Cheng
MP
2008
99views more  MP 2008»
13 years 7 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
PLDI
1994
ACM
13 years 11 months ago
Division by Invariant Integers using Multiplication
Integer division remains expensive on today's processors as the cost of integer multiplication declines. We present code sequences for division by arbitrary nonzero integer c...
Torbjörn Granlund, Peter L. Montgomery