| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping | Fairstein, Yaron et al. | 2021 |
| 2 | A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem | Fairstein, Yaron et al. | 2020 |
| 3 | Maximizing Throughput in Flow Shop Real-Time Scheduling | Ben Yamin, Lior et al. | 2020 |
| 4 | Generalized Assignment via Submodular Optimization with Reserved Capacity | Kulik, Ariel et al. | 2019 |
| 5 | The Preemptive Resource Allocation Problem | Sarpatwar, Kanthi et al. | 2019 |
| 6 | Generalized Assignment of Time-Sensitive Item Groups | Sarpatwar, Kanthi et al. | 2018 |
| 7 | The Container Selection Problem | Nagarajan, Viswanath et al. | 2015 |
| 8 | Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) | Jansen, Klaus et al. | 2011 |
| 9 | Minimizing Busy Time in Multiple Machine Real-time Scheduling | Khandekar, Rohit et al. | 2010 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |