A note on the online interval scheduling secretary problem
From MaRDI portal
Publication:2670476
DOI10.1016/j.orl.2021.12.007OpenAlexW4200125285MaRDI QIDQ2670476
Ruilong Zhang, Bo Li, Chen-Hao Wang
Publication date: 11 March 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2021.12.007
Cites Work
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
- A Knapsack Secretary Problem with Applications
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A note on the online interval scheduling secretary problem