An accurate solution to the cardinality-based punctuality problem
This paper focuses on a specific stochastic shortest path (SSP) problem, namely the punctuality problem. It aims to determine a path that maximizes the probability of arriving at the destination before a specified deadline. The popular solution to this problem always formulates it as a cardinality m...
Saved in:
Main Authors: | CAO, Zhiguang, WU, Yaoxin, RAO, Akshay, KLANNER, Felix, ERSCHEN, Stefan, CHEN, Wei, ZHANG, Le, GUO, Hongliang |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2020
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8151 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
An accurate solution to the cardinality-based punctuality problem
by: Cao, Zhiguang, et al.
Published: (2020) -
Finding the shortest path in stochastic vehicle routing: A cardinality minimization approach
by: CAO, Zhiguang, et al.
Published: (2016) -
Learning scenario representation for solving two-stage stochastic integer programs
by: WU, Yaoxin, et al.
Published: (2022) -
Efficient gradient support pursuit with less hard thresholding for cardinality-constrained learning
by: SHANG, Fanhua, et al.
Published: (2021) -
Characteristics and injury patterns of road traffic injuries in urban and rural Uganda—a retrospective medical record review study in two hospitals
by: Temizel, Selin, et al.
Published: (2022)