Balogh János and Epstein Leah and Levin Asaf:
Lower bounds for online bin covering-type problems.
JOURNAL OF SCHEDULING, 22 (4).
pp. 487-497.
ISSN 1094-6136
(2019)
![[thumbnail of lb_vc1_5.pdf]](http://publicatio.bibl.u-szeged.hu/style/images/fileicons/text.png) |
Text
lb_vc1_5.pdf - Submitted Version Closed access: Repository staff only Download (139kB) | Request a copy |
| Creators: |
|
|||
|---|---|---|---|---|
| Item Type: | Journal Article | |||
| Journal or Publication Title: | JOURNAL OF SCHEDULING | |||
| Date: | 2019 | |||
| Volume: | 22 | |||
| Number: | 4 | |||
| Page Range: | pp. 487-497 | |||
| ISSN: | 1094-6136 | |||
| Faculty/Unit: | Gyula Juhász Faculty of Education | |||
| Institution: | University of Szeged (2000-) | |||
| Language: | English | |||
| MTMT rekordazonosító: | 30319413 | |||
| DOI azonosító: | https://doi.org/10.1007/s10951-018-0590-0 | |||
| Date Deposited: | 2025. Feb. 10. 11:06 | |||
| Last Modified: | 2025. Feb. 10. 11:06 | |||
| URI: | http://publicatio.bibl.u-szeged.hu/id/eprint/35963 |
Actions (login required)
 |
View Item |
Download Statistics
Download Statistics
