Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs

ACM Transactions on Algorithms

Volumn 4, Issue 3, 2008, Pages

  Even, Guy ^a   Levi, Retsef ^b,e   Rawitz, Dror ^c   Schieber, Baruch ^d   Shahar, Shimon ^a   Sviridenko, Maxim ^d  

^a TEL AVIV UNIVERSITY   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF HAIFA   (Israel)

^d IBM T J WATSON RESEARCH CENTER   (United States)

^e MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; Capacitated covering; Lot sizing; Rectangle stabbing

Indexed keywords

APPROXIMATE SOLUTIONS; AXIS-PARALLEL RECTANGLES; BI-CRITERIA; INVENTORY PROBLEMS; JOINT SETS; LOT SIZING; MINIMUM SIZE; MULTI ITEM; POLYNOMIAL-TIME ALGORITHMS; RECTANGLE STABBING; SINGLE COPY; TWO-DIMENSIONAL (2D); VERTICAL LINES;

ALGORITHMS; APPROXIMATION ALGORITHMS; BOOLEAN FUNCTIONS; POLYNOMIAL APPROXIMATION; SOLUTIONS; TWO DIMENSIONAL;

SET THEORY;

EID: 47249132941     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1367064.1367074     Document Type: Article

References (19)

1. ANILY, S., AND TZUR, M. 2005. Shipping multiple-items by capacitated vehicles - An optimal dynamic programming approach. Transport. Sci. 39, 233-248.
2. ANILY, S., TZUR, M., AND WOLSEY, L. A. 2005. Multi-item lot-sizing with joint set-up cost. Submitted for publication.
3. BAPTISTE, P. 2006. Scheduling unit tasks to minimize the number of idle periods: A polynomial time algorithm for offline dynamic power management. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 364-367.
4. BAR-ILAN, J., KORTSARZ, G., AND PELEG, D. 2001. Generalized submodular cover problems and applications. Theoret. Comp. Sci. 250, 179-200.
5. CHUZHOY, J., AND NAOR, J. 2006. Covering problems with hard capacities. SIAM J. Comput. 36, 2, 498-515.
6. EVEN, G., RAWITZ, D., AND SHAHAR, S. 2006. Approximation algorithms for capacitated rectangle stabbing. In Proceedings of the 6th International Conference on Algorithms and Complexity. Lecture Notes in Computer Science, vol. 3998. Springer-Verlag, New York, 18-29.
7. FEIGE, U. 1998. A threshold of ln n for approximating set cover. J. ACM 45, 4, 634-652.
8. FLORIAN, M., LENSTRA, J. K., AND RINOOY KAN, A. H. G. 1980. Deterministic production planning: Algorithms and complexity. Manage. Sci. 26, 669-679.
9. GANDHI, R., HALPERIN, E., KHULLER, S., KORTSARZ, G., AND SRINIVASAN, A. 2006. An improved approximation algorithm for vertex cover with hard capacities. J. Comput. Syst. Sci. 72, 1, 16-33.
10. GAUR, D. R., IBARAKI, T., AND KRISHNAMURTI, R. 2002. Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem. J. Algor. 43, 138-152.
11. GOLUMBIC, M. C. 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York.
12. GUHA, S., HASSIN, R., KHULLER, S., AND OR, E. 2003. Capacitated vertex covering. J. Algor. 48, 1, 257-270.
13. HASSIN, R., AND MEGIDDO, N. 1991. Approximation algorithms for hitting objects with straight lines. Disc. Appl. Math. 30, 1, 29-42.
14. KOVALEVA, S., AND SPIEKSMA, F. C. R. 2004. Approximation of rectangle stabbing and interval stabbing problems. In Proceedings of the 12th European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 3221. Springer-Verlag, New York, 426-435.
15. LAWLER, E. 2001. Combinatorial Optimization: Networks and matroids. Courier Dover Publications.
16. LEVI, R., LODI, A., AND SVIRIDENKO, M. 2007. Approximation algorithms for the multi-item capacitated lot-sizing problem via flow-cover inequalities. In Proceedings of the 12th Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 4513. Springer-Verlag, New York, 454-468.
17. RAZ, R., AND SAFRA, S. 1997. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proceedings of the 29th ACM Symposium on the Theory of Computing. ACM, New York, 475-484.
18. SHAHAR, S. 2006. Approximation algorithms for problems with geometrical structure. Ph.D. dissertation. School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel.
19. WOLSEY, L. A. 1982. An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2, 385-393.