TY  - JOUR
Y1  - 2019///
UR  - https://doi.org/10.1007/s10951-018-0590-0
IS  - 4
SP  - 487
JF  - JOURNAL OF SCHEDULING
A1  -  Balogh János
A1  -  Epstein Leah
A1  -  Levin Asaf
VL  - 22
TI  - Lower bounds for online bin covering-type problems
EP  - 497
AV  - restricted
SN  - 1094-6136
N1  - Export Date: 13 April 2022            
            Correspondence Address: Levin, A.; Faculty of Industrial Engineering and Management, Israel; email: levinas@ie.technion.ac.il            
            Funding details: European Commission, EC            
            Funding details: German-Israeli Foundation for Scientific Research and Development, GIF, I-1366-407.6/2016            
            Funding details: European Social Fund, ESF, EFOP-3.6.3-VEKOP-16-2017-00002            
            Funding text 1: J. Balogh was supported by the European Union, co-financed by the European Social Fund (project ?Integrated program for training new generation of scientists in the fields of computer science?, No. EFOP-3.6.3-VEKOP-16-2017-00002). L. Epstein and A. Levin were partially supported by a Grant from GIF?the German-Israeli Foundation for Scientific Research and Development (Grant No. I-1366-407.6/2016).
ID  - publicatio35963
ER  -