Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems
From MaRDI portal
Publication:6168933
DOI10.1007/978-3-031-22105-7_9arXiv2208.11832MaRDI QIDQ6168933
Samitha Samaranayake, Hongyi Jiang
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.11832
Related Items (1)
Cites Work
- Packing items into several bins facilitates approximating the separable assignment problem
- The Online Stochastic Generalized Assignment Problem
- Tight Approximation Algorithms for Maximum Separable Assignment Problems
- Simultaneous Network Line Planning and Traffic Assignment.
- A Direct Connection Approach to Integrated Line Planning and Passenger Routing
- A threshold of ln n for approximating set cover
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers
- Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems
This page was built for publication: Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems