Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems
From MaRDI portal
Publication:6633554
DOI10.1016/j.dam.2024.09.020MaRDI QIDQ6633554
Hongyi Jiang, Samitha Samaranayake
Publication date: 6 November 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Algorithms in computer science (68Wxx) Mathematical programming (90Cxx) Operations research and management science (90Bxx)
Cites Work
- Line planning in public transportation: models and methods
- 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
- Improved algorithms for orienteering and related problems
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Data-Driven Transit Network Design at Scale
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- Non-monotone submodular maximization under matroid and 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 algorithm for generalized budgeted assignment problems and applications in transportation systems
