SIGN IN
SIGN UP
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
Full Text:
Pdf
Buy this Article
Authors:
Guy Even
Tel-Aviv University, Tel-Aviv, Israel
Retsef Levi
Massachusetts Institute of Technology, MIT Cambridge, MA
Dror Rawitz
University of Haifa, Haifa, Israel
Baruch Schieber
IBM T.J. Watson Research Center, Yorktown Heights, NY
Shimon (Moni) Shahar
Tel-Aviv University, Tel-Aviv, Israel
Maxim Sviridenko
IBM T.J. Watson Research Center, Yorktown Heights, NY
2008 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 52
· Downloads (cumulative): 290
· Citation Count: 9
Published in:
· Journal
ACM Transactions on Algorithms (TALG)
TALG Homepage
archive
Volume 4 Issue 3, June 2008
Article No. 34
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1367064.1367074
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
approximation algorithms
capacitated covering
combinatorial algorithms
computations on discrete structures
lot sizing
rectangle stabbing
sequencing and scheduling
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder