Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
A branch-and-cut algorithm for the pallet loading problem
Computers and Operations Research
Limited view CT reconstruction and segmentation via constrained metric labeling
Computer Vision and Image Understanding
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Approximating integer programs with positive right-hand sides
Information Processing Letters
Geometric rounding: a dependent randomized rounding scheme
Journal of Combinatorial Optimization
Generalized machine activation problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On dependent randomized rounding algorithms
Operations Research Letters
| Hi-index | 0.00 |