Researcher interests: Stochastic programming, with emphasis on applications in supply chain management, logistics, economics and finance. Combinatorial optimization; stochastic dynamic programming. Fully polynomial time approximation schemes. Geometric optimization. Helly type theorems. Location theory. Linear programming. Linear time algorithms. Game theory.
FACULTY / SCHOOL: School of Business Administration
DEPARTMENT: Operations Research
Selected Publications
the tv advertisements scheduling problem (2019)|
Optimization Letters|
Read more
bi criteria path problem with minimum length and maximum survival probability (2018)|
OR Spectrum|
Read more
approximation schemes for non separable non linear boolean programming problems under nested knapsack constraints (2018)|
European Journal of Operational Research|
Read more
an fptas for the knapsack problem with parametric weights (2018)|
Operations Research Letters|
Read more
toward breaking the curse of dimensionality an fptas for stochastic dynamic programs with multidimensional actions and scalar states (2018)|
arXiv preprint arXiv:1811.11680|
Read more
on the complexity of energy storage problems (2017)|
Discrete Optimization|
Read more
a deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (2016)|
Theoretical Computer Science|
Read more
provably near optimal approximation schemes for implicit stochastic and for sample based dynamic programs (2016)|
|
Read more
a deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (2016)|
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)|
Read more
a computationally efficient fptas for convex stochastic dynamic programs ()|
european symposium on algorithms|
Read more
