%L publicatio35963
%J JOURNAL OF SCHEDULING
%I szte
%O 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).
%T Lower bounds for online bin covering-type problems
%N 4
%A  Balogh JĂĄnos
%A  Epstein Leah
%A  Levin Asaf
%P 487-497
%R MTMT:30319413 10.1007/s10951-018-0590-0
%V 22
%D 2019