A note on the optimal stopping parking problem
From MaRDI portal
Publication:1785331
DOI10.1016/J.ORL.2014.12.006zbMATH Open1408.60033OpenAlexW2072085016MaRDI QIDQ1785331FDOQ1785331
Authors: Nguyen L. Truong
Publication date: 28 September 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2014.12.006
Recommendations
Linear programming (90C05) Stopping times; optimal stopping problems; gambling theory (60G40) Markov and semi-Markov decision processes (90C40)
Cites Work
Cited In (9)
- Title not available (Why is that?)
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
- Title not available (Why is that?)
- Optimal stopping in the parking problem with U-turn
- The Parking Problem for Finite-State Robots
- On the optimization of pit stop strategies via dynamic programming
- On the optimal parking problem
- On generalizations of the parking permit problem and network leasing problems
- On Markov-dependent parking problems
This page was built for publication: A note on the optimal stopping parking problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785331)