Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems
From MaRDI portal
Publication:6633554
Recommendations
- Randomized approximation and online algorithms for assignment problems
- Approximation algorithms for a generalization of the maximum budget allocation
- Maximum generalized assignment with convex costs
- An efficient approximation for the generalized assignment problem
- Tight approximation algorithms for maximum separable assignment problems
Cites work
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- Bayesian combinatorial auctions: expanding single buyer mechanisms to many buyers
- Data-driven transit network design at scale
- Improved algorithms for orienteering and related problems
- Line planning in public transportation: models and methods
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Maximizing a monotone submodular function subject to a matroid constraint
- Non-monotone submodular maximization under matroid and knapsack constraints
- 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
This page was built for publication: Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633554)
