| Publication | Date of Publication | Type |
|---|
Probabilistic bounds on the \(k\)-traveling salesman problem and the traveling repairman problem
Mathematics of Operations Research | 2024-06-27 | Paper |
Edge-Weighted Online Windowed Matching
Mathematics of Operations Research | 2024-02-23 | Paper |
Universal regression with adversarial responses
The Annals of Statistics | 2023-08-31 | Paper |
Probabilistic bounds on the $k-$Traveling Salesman Problem and the Traveling Repairman Problem
| 2022-11-20 | Paper |
Additional Results and Extensions for the paper "Probabilistic bounds on the $k-$Traveling Salesman Problem and the Traveling Repairman Problem
| 2022-11-20 | Paper |
Strategic workforce planning under uncertainty
Operations Research | 2022-05-31 | Paper |
Probability Distributions on Partially Ordered Sets and Network Interdiction Games
Mathematics of Operations Research | 2022-05-17 | Paper |
An iterative security game for computing robust and adaptive network flows
Computers & Operations Research | 2022-03-09 | Paper |
Online resource allocation under partially predictable demand
Operations Research | 2021-07-29 | Paper |
Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios
INFORMS Journal on Computing | 2021-06-23 | Paper |
Planning a multi-sensors search for a moving target considering traveling costs
European Journal of Operational Research | 2021-06-07 | Paper |
On matching and thickness in heterogeneous dynamic markets
Operations Research | 2020-10-26 | Paper |
Robust adaptive routing under uncertainty
Operations Research | 2020-10-05 | Paper |
An improved lower bound for the traveling salesman constant
Operations Research Letters | 2020-02-11 | Paper |
Stochastic Dynamic Pricing for Same-Day Delivery Routing
| 2019-12-05 | Paper |
Exponential convergence rates for stochastically ordered Markov processes under perturbation
Systems & Control Letters | 2019-11-21 | Paper |
An Improved Lower Bound for the Traveling Salesman Constant
| 2019-07-04 | Paper |
The \(K\)-server problem via a modern optimization lens
European Journal of Operational Research | 2019-02-25 | Paper |
An average-case asymptotic analysis of the container relocation problem
Operations Research Letters | 2019-01-15 | Paper |
A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations
European Journal of Operational Research | 2018-07-25 | Paper |
Yard crane scheduling for container storage, retrieval, and relocation
European Journal of Operational Research | 2018-07-25 | Paper |
Online spatio-temporal matching in stochastic and dynamic domains
Artificial Intelligence | 2018-06-27 | Paper |
An algorithm with performance guarantee for the online container relocation problem
European Journal of Operational Research | 2018-05-25 | Paper |
Online traveling salesman problems with rejection options
Networks | 2018-05-23 | Paper |
Online scheduling with multi-state machines
Networks | 2018-04-27 | Paper |
On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Discrete Newton's algorithm for parametric submodular function minimization
| 2017-08-31 | Paper |
Sampling Based Approaches for Minimizing Regret in Uncertain Markov Decision Processes (MDPs)
Journal of Artificial Intelligence Research | 2017-07-13 | Paper |
Separable Convex Optimization with Nested Lower and Upper Constraints
| 2017-03-04 | Paper |
A stochastic algorithm for online bipartite resource allocation problems
Computers & Operations Research | 2016-11-17 | Paper |
A decomposition algorithm for nested resource allocation problems
SIAM Journal on Optimization | 2016-06-03 | Paper |
Routing optimization under uncertainty
Operations Research | 2016-05-13 | Paper |
Randomized minmax regret for combinatorial optimization under uncertainty
Algorithms and Computation | 2016-01-11 | Paper |
Average-case performance of rollout algorithms for knapsack problems
Journal of Optimization Theory and Applications | 2015-06-18 | Paper |
Online stochastic matching: new algorithms with better bounds
Mathematics of Operations Research | 2015-03-31 | Paper |
Log-Quadratic Bounds for the Gaussian Q-function
| 2013-04-09 | Paper |
Advances on matroid secretary problems: free order model and laminar case
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Valuation of Commodity-Based Swing Options
Management Science | 2012-02-19 | Paper |
Online traveling salesman problems with service flexibility
Networks | 2011-11-21 | Paper |
The machine learning and traveling repairman problem
Algorithmic Decision Theory | 2011-10-28 | Paper |
Almost sure asymptotic optimality for online routing and machine scheduling problems
Networks | 2010-11-24 | Paper |
Online Vehicle Routing Problems: A Survey
Operations Research/Computer Science Interfaces | 2010-06-02 | Paper |
Logistics in real time inventory routing operations under stochastic demand
Lecture Notes in Economics and Mathematical Systems | 2010-01-20 | Paper |
Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
Operations Research | 2009-08-13 | Paper |
Online Searching
Operations Research | 2009-07-03 | Paper |
Note: Online Searching / on the Optimality of the Geometric Sequences for the m Ray Search Online Searching
Operations Research | 2009-07-03 | Paper |
Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework
Transportation Science | 2003-06-29 | Paper |
A decomposition approach to the inventory routing problem with satellite facilities
Transportation Science | 2002-04-17 | Paper |
Airline network design and hub location problems
Location Science | 1999-03-01 | Paper |
scientific article; zbMATH DE number 956788 (Why is no real title available?)
| 1997-09-15 | Paper |
On properties of geometric random problems in the plane
Annals of Operations Research | 1996-02-26 | Paper |
On reliability of graphs with node failures
Networks | 1994-08-29 | Paper |
Rate of convergence for the Euclidean minimum spanning tree limit law
Operations Research Letters | 1994-03-24 | Paper |
Cube versus torus models and the Euclidean minimum spanning tree constant
The Annals of Applied Probability | 1993-10-28 | Paper |
Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces
Mathematics of Operations Research | 1993-06-29 | Paper |
Rates of Convergence for Quasi-Additive Smooth Euclidean Functionals and Application to Combinatorial Optimization Problems
Mathematics of Operations Research | 1993-03-01 | Paper |
Shortest path problems with node failures
Networks | 1993-01-17 | Paper |
scientific article; zbMATH DE number 3234 (Why is no real title available?)
| 1992-06-25 | Paper |
Variational inequalities and the pricing of American options
Acta Applicandae Mathematicae | 1990-01-01 | Paper |
A Priori Optimization
Operations Research | 1990-01-01 | Paper |
A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
Operations Research | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4066604 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4051377 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4055347 (Why is no real title available?)
| 1987-01-01 | Paper |
When Should you Offer an Upgrade: Online Upgrading Mechanisms for Resource Allocation
| N/A | Paper |
