Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems
From MaRDI portal
Publication:6633554
DOI10.1016/J.DAM.2024.09.020MaRDI QIDQ6633554FDOQ6633554
Hongyi Jiang, Samitha Samaranayake
Publication date: 6 November 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Algorithms in computer science (68Wxx) Operations research and management science (90Bxx) Mathematical programming (90Cxx)
Cites Work
- Tight approximation algorithms for maximum separable assignment problems
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Line planning in public transportation: models and methods
- Non-monotone submodular maximization under matroid and knapsack constraints
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- The Online Stochastic Generalized Assignment Problem
- Improved algorithms for orienteering and related problems
- Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers
- Packing items into several bins facilitates approximating the separable assignment problem
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Data-Driven Transit Network Design at Scale
- Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems
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)
