Asaf Levin
Technion - Israel Institute of Technology
H-index: 33
Asia-Israel
Top articles of Asaf Levin
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
The near exact bin covering problem | Algorithmica | Asaf Levin | 2024/3/19 |
Scheduling with cardinality dependent unavailability periods | European Journal of Operational Research | G Jaykrishnan Asaf Levin | 2024/3/1 |
EPTAS for parallel identical machine scheduling with time restrictions | Journal of Combinatorial Optimization | G Jaykrishnan Asaf Levin | 2024/3 |
Tight Lower Bounds for Block-Structured Integer Programs | arXiv preprint arXiv:2402.17290 | Christoph Hunkenschröder Kim-Manuel Klein Martin Koutecký Alexandra Lassota Asaf Levin | 2024/2/27 |
Selecting intervals to optimize the design of observational studies subject to fine balance constraints | Journal of Combinatorial Optimization | Asaf Levin | 2024/4 |
EPTAS for the dual of splittable bin packing with cardinality constraint | Theoretical Computer Science | G Jaykrishnan Asaf Levin | 2023/11/10 |
High-multiplicity N-fold IP via configuration LP | Mathematical programming | Dušan Knop Martin Koutecký Asaf Levin Matthias Mnich Shmuel Onn | 2023/6 |
Reducibility bounds of objective functions over the integers | Operations Research Letters | Friedrich Eisenbrand Christoph Hunkenschröder Kim-Manuel Klein Martin Koutecký Asaf Levin | 2023/11/1 |
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times | Acta Informatica | Asaf Levin Tal Shusterman | 2023/6 |
Online cardinality constrained scheduling | Operations Research Letters | Leah Epstein Alexandra Lassota Asaf Levin Marten Maack Lars Rohwedder | 2023/9/1 |
EPTAS for load balancing problem on parallel machines with a non-renewable resource | Discrete Optimization | G Jaykrishnan Asaf Levin | 2023/5/1 |
Algorithms and Complexities of Matching Variants in Covariate Balancing | Operations Research | Dorit S Hochbaum Asaf Levin Xu Rao | 2023/9 |
Online Minimization of the Maximum Starting Time: Migration Helps | Algorithmica | Asaf Levin | 2023/8 |
Lower bounds for batched bin packing | Journal of Combinatorial Optimization | János Balogh József Békési György Dósa Leah Epstein Asaf Levin | 2022/4 |
Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes | Information Processing Letters | Asaf Levin | 2022/3/1 |
Approximation schemes for the generalized extensible bin packing problem | Algorithmica | Asaf Levin | 2022/2 |
Comparing the costs of Any Fit algorithms for bin packing | Operations Research Letters | Asaf Levin | 2022/11/1 |
Starting time minimization for the maximum job variant | Discrete Applied Mathematics | Leah Epstein Asaf Levin | 2022/1/30 |
Approximate separable multichoice optimization over monotone systems | Discrete Optimization | Martin Koutecký Asaf Levin Syed M Meesum Shmuel Onn | 2022/5/1 |
Cardinality constrained scheduling in online models | arXiv preprint arXiv:2201.05113 | Leah Epstein Alexandra Lassota Asaf Levin Marten Maack Lars Rohwedder | 2022/1/13 |
