Develops the first approximation algorithms with guarantees for line planning using heterogeneous fleets and multiple resource constraints, achieving 1-1/e ratio for cost-free case via randomized rounding.
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints
Develops the first approximation algorithms with guarantees for line planning using heterogeneous fleets and multiple resource constraints, achieving 1-1/e ratio for cost-free case via randomized rounding.