1647 search results - page 167 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
146
click to vote
EOR
2006
15 years 5 months ago
2006
Flexibility and automation in assembly lines can be achieved by the use of robots. The robotic assembly line balancing (RALB) problem is defined for robotic assembly line, where d...
145
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
163
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
119
click to vote
ICCD
2003
IEEE
16 years 2 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
157
click to vote
JCO
2008
15 years 5 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...