51 search results - page 4 / 11 » jco 2006 |
JCO
2000
14 years 9 months ago
2000
We show that the problem of finding a perfect matching satisfying a single equality constraint with a 0
JCO
2010
14 years 8 months ago
2010
Abstract As a generalization of de-disjunct matrices and (w,r;d)-cover-freefamilies, the notion of (s,l)e-disjunct matrices is introduced for error-correcting pooling designs over ...
JCO
2006
14 years 9 months ago
2006
In this paper, we compare several 0-1 linear programs for solving the satellite mission planning problem. We prove that one of them presents a smaller integrality gap. Our explana...
JCO
2006
14 years 9 months ago
2006
A k-decomposition of a tree is a process in which the tree is recursively partitioned into k edge-disjoint subtrees until each subtree contains only one edge. We investigated the p...
JCO
2002
14 years 9 months ago
2002
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...