Sciweavers

2976 search results - page 95 / 596
» On the bounded integer programming
Sort
View
86
Voted
EOR
2006
83views more  EOR 2006»
15 years 16 days ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...
68
Voted
ESA
2001
Springer
61views Algorithms» more  ESA 2001»
15 years 5 months ago
A Separation Bound for Real Algebraic Expressions
Real algebraic expressions are expressions whose leaves are integers and whose internal nodes are additions, subtractions, multiplications, divisions, k-th root operations for int...
Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, S...
CAV
2000
Springer
89views Hardware» more  CAV 2000»
15 years 4 months ago
Tuning SAT Checkers for Bounded Model Checking
Abstract. Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search fo...
Ofer Strichman
81
Voted
ANTS
2006
Springer
94views Algorithms» more  ANTS 2006»
15 years 4 months ago
Fast Bounds on the Distribution of Smooth Numbers
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
Scott T. Parsell, Jonathan Sorenson
113
Voted
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
15 years 17 days ago
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
János Barát, Jirí Matousek, D...