2976 search results - page 133 / 596 » On the bounded integer programming |
121
click to vote
CCO
2001
Springer
15 years 7 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
96
Voted
DM
2000
15 years 2 months ago
2000
We study the number of ways to factor a natural number n into an ordered product of integers, each factor greater than one, denoted by H(n). This counting function from number the...
173
Voted
WAW
2010
Springer
15 years 15 days ago
2010
Springer
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...
161
Voted
JMLR
2012
13 years 5 months ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
110
Voted
WCET
2008
15 years 4 months ago
2008
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...