| Publication | Date of Publication | Type |
|---|
A trust-region framework for derivative-free mixed-integer optimization
Mathematical Programming Computation | 2024-11-29 | Paper |
Fast quantum subroutines for the simplex method
Operations Research | 2024-07-25 | Paper |
| Quantum tomography using state-preparation unitaries | 2024-05-14 | Paper |
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
Mathematical Programming. Series A. Series B | 2024-04-09 | Paper |
Special issue: International symposium on mathematical programming 2022
Mathematical Programming. Series A. Series B | 2023-06-23 | Paper |
Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
Mathematical Programming. Series A. Series B | 2022-10-24 | Paper |
On the implementation of a global optimization method for mixed-variable problems
OJMO. Open Journal of Mathematical Optimization | 2022-08-20 | Paper |
Nonlinear chance-constrained problems with applications to hydro scheduling
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs
Mathematical Programming Computation | 2022-01-10 | Paper |
Fast quantum subroutines for the simplex method
(available as arXiv preprint) | 2021-12-21 | Paper |
An introduction to quantum computing, without the physics
SIAM Review | 2020-12-16 | Paper |
An exact algorithm for robust influence maximization
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
An exact algorithm for robust influence maximization
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional actions and scalar states
SIAM Journal on Optimization | 2019-05-07 | Paper |
RBFOpt: an open-source library for black-box optimization with costly function evaluations
Mathematical Programming Computation | 2019-05-03 | Paper |
MILP models for the selection of a small set of well-distributed points
Operations Research Letters | 2019-02-21 | Paper |
On the complexity of energy storage problems
Discrete Optimization | 2018-08-17 | Paper |
| Optimizing allocation in a warehouse network | 2018-04-11 | Paper |
A computationally efficient FPTAS for convex stochastic dynamic programs
SIAM Journal on Optimization | 2017-01-13 | Paper |
Core routing on dynamic time-dependent road networks
INFORMS Journal on Computing | 2016-06-29 | Paper |
| Branching on split disjunctions | 2014-11-10 | Paper |
On the safety of Gomory cut generators
Mathematical Programming Computation | 2014-10-06 | Paper |
A recipe for finding good solutions to MINLPs
Mathematical Programming Computation | 2013-11-28 | Paper |
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
Mathematical Programming Computation | 2013-11-28 | Paper |
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Rounding-based heuristics for nonconvex MINLPS
Mathematical Programming Computation | 2012-11-27 | Paper |
How tight is the corner relaxation? Insights gained from the stable set problem
Discrete Optimization | 2012-09-11 | Paper |
Bidirectional \(A^*\) search on time-dependent road networks
Networks | 2012-06-18 | Paper |
Improved strategies for branching on general disjunctions
Mathematical Programming. Series A. Series B | 2011-12-14 | Paper |
A probing algorithm for MINLP with failure prediction by SVM
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2011-05-26 | Paper |
Point-to-point shortest paths on dynamic time-dependent road networks
4OR | 2010-12-06 | Paper |
Fast paths in large-scale dynamic road networks
Computational Optimization and Applications | 2010-03-15 | Paper |
Shortest paths on dynamic graphs
International Transactions in Operational Research | 2009-10-28 | Paper |
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
Algorithms and Computation | 2009-01-29 | Paper |
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
| A local branching heuristic for MINLPs | 2008-12-11 | Paper |
Bidirectional A ∗ Search for Time-Dependent Fast Paths
Experimental Algorithms | 2008-06-13 | Paper |
