| Publication | Date of Publication | Type |
|---|
Hardness of pricing routes for two-stage stochastic vehicle routing problems with scenarios
Operations Research | 2025-11-10 | Paper |
A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
Operations Research Letters | 2023-06-27 | Paper |
The arc-item-load and related formulations for the cumulative vehicle routing problem
Discrete Optimization | 2022-09-15 | Paper |
Multirow Intersection Cuts Based on the Infinity Norm
INFORMS Journal on Computing | 2022-06-28 | Paper |
A novel stochastic programming approach for scheduling of batch processes with decision dependent time of uncertainty realization
Annals of Operations Research | 2021-11-09 | Paper |
Permutations in the Factorization of Simplex Bases
INFORMS Journal on Computing | 2020-12-09 | Paper |
Split cuts from sparse disjunctions
Mathematical Programming Computation | 2020-08-27 | Paper |
Opposite elements in clutters
Mathematics of Operations Research | 2020-03-12 | Paper |
Adjustable robust optimization for multi-tasking scheduling with reprocessing due to imperfect tasks
Optimization and Engineering | 2020-02-26 | Paper |
| Optimized Cranial Bandeau Remodeling | 2019-12-22 | Paper |
The (not so) trivial lifting in two dimensions
Mathematical Programming Computation | 2019-12-19 | Paper |
Bi-objective short-term scheduling in a rolling horizon framework: a priori approaches with alternative operational objectives
Computers & Operations Research | 2019-09-25 | Paper |
Intersection cuts for single row corner relaxations
Mathematical Programming Computation | 2018-11-09 | Paper |
Exact algorithms for the chance-constrained vehicle routing problem
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Numerically safe lower bounds for the capacitated vehicle routing problem
INFORMS Journal on Computing | 2017-12-29 | Paper |
Exact algorithms for the chance-constrained vehicle routing problem
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
On the mixing set with a knapsack constraint
Mathematical Programming. Series A. Series B | 2016-06-06 | Paper |
On the mixing set with a knapsack constraint
Mathematical Programming. Series A. Series B | 2016-06-06 | Paper |
The time dependent traveling salesman problem: polyhedra and algorithm
Mathematical Programming Computation | 2013-04-12 | Paper |
Numerically safe Gomory mixed-integer cuts
INFORMS Journal on Computing | 2012-07-28 | Paper |
Strengthening lattice-free cuts using non-negativity
Discrete Optimization | 2012-06-20 | Paper |
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
Networks | 2012-06-18 | Paper |
The master equality polyhedron with multiple rows
Mathematical Programming. Series A. Series B | 2012-04-27 | Paper |
On the exact separation of mixed integer knapsack cuts
Mathematical Programming. Series A. Series B | 2011-06-17 | Paper |
Lifting, tilting and fractional programming revisited
Operations Research Letters | 2010-12-23 | Paper |
On a generalization of the master cyclic group polyhedron
Mathematical Programming. Series A. Series B | 2010-10-13 | Paper |
Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
Mathematical Programming. Series A. Series B | 2008-01-07 | Paper |
On a Generalization of the Master Cyclic Group Polyhedron
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
On the Exact Separation of Mixed Integer Knapsack Cuts
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Robust branch-and-cut-and-price for the capacitated vehicle routing problem
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
