1 citations · 1 across the 2 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2020
Surprise Maximization: A Dynamic Programming Approach
Ali Eshragh
Borwein et al. (2000) solved a surprise maximization problem by applying results from convex analysis and mathematical programming. Although, their proof is elegant, it requires ad…
math.OC2019
An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach
Ali Eshragh, Rasul Esmaeilbeigi, Richard Middleton
We present an analytical upper bound on the number of required vehicles for vehicle routing problems with split deliveries and any number of capacitated depots. We show that a flee…