| Publication | Date of Publication | Type |
|---|
Approximating optimization problems in graphs with locational uncertainty
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2025-05-07 | Paper |
Designing compact, connected and gap-free reserves with systematic reserve site selection models
Applied Mathematical Modelling | 2025-03-17 | Paper |
Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty
OJMO. Open Journal of Mathematical Optimization | 2024-11-05 | Paper |
A dedicated pricing algorithm to solve a large family of nurse scheduling problems with branch-and-price
INFORMS Journal on Computing | 2024-09-05 | Paper |
KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price
Mathematical Programming Computation | 2024-06-01 | Paper |
Optimization Problems in Graphs with Locational Uncertainty
INFORMS Journal on Computing | 2024-02-28 | Paper |
A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits
Networks | 2023-12-11 | Paper |
Regularized Optimal Transport of Covariates and Outcomes in Data Recoding
Journal of the American Statistical Association | 2023-03-09 | Paper |
The referenced vertex ordering problem: theory, applications, and solution methods
OJMO. Open Journal of Mathematical Optimization | 2022-08-20 | Paper |
Identifying relatively irreducible infeasible subsystems of linear inequalities
Annals of Operations Research | 2021-11-09 | Paper |
A rotation-based branch-and-price approach for the nurse scheduling problem
Mathematical Programming Computation | 2021-01-25 | Paper |
| Vertex ordering with optimal number of adjacent predecessors | 2020-10-28 | Paper |
An online stochastic algorithm for a dynamic nurse scheduling problem
European Journal of Operational Research | 2020-05-26 | Paper |
An integer programming approach for the search of discretization orders in distance geometry problems
Optimization Letters | 2020-04-27 | Paper |
An application-based characterization of dynamical distance geometry problems
Optimization Letters | 2020-04-27 | Paper |
Time-dependent shortest paths with discounted waits
Networks | 2019-10-31 | Paper |
A generalized direction in interior point method for monotone linear complementarity problems
Optimization Letters | 2019-03-21 | Paper |
Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem
European Journal of Operational Research | 2018-05-24 | Paper |
A new variant of the minimum-weight maximum-cardinality clique problem to solve conflicts between aircraft
Advances in Intelligent Systems and Computing | 2017-09-12 | Paper |
A space-discretized mixed-integer linear model for air-conflict resolution with speed and heading maneuvers
Computers & Operations Research | 2016-11-10 | Paper |
The positive edge pricing rule for the dual simplex
Computers & Operations Research | 2016-11-10 | Paper |
A linear programming decomposition focusing on the span of the nondegenerate columns
European Journal of Operational Research | 2016-10-06 | Paper |
Improved primal simplex: a more general theoretical framework and an extended experimental analysis
INFORMS Journal on Computing | 2016-04-25 | Paper |
