| Publication | Date of Publication | Type |
|---|
A trust-region framework for derivative-free mixed-integer optimization
Mathematical Programming Computation | 2024-11-29 | Paper |
Robustness of solutions to the capacitated facility location problem with uncertain demand
Optimization Letters | 2022-11-01 | Paper |
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
INFORMS Journal on Computing | 2022-06-27 | Paper |
A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs
Mathematical Programming Computation | 2022-01-10 | Paper |
The Schrijver system of the flow cone in series-parallel graphs
Discrete Applied Mathematics | 2022-01-05 | Paper |
A constraints-aware reweighted feasibility pump approach
Operations Research Letters | 2021-12-13 | Paper |
A branch-and-price algorithm for the minimum sum coloring problem
Discrete Applied Mathematics | 2021-09-15 | Paper |
Efficient formulations for the traveling car renter problem and its quota variant
Optimization Letters | 2021-08-19 | Paper |
A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem
European Journal of Operational Research | 2021-06-03 | 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 |
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
Discrete Optimization | 2019-11-28 | Paper |
Shared mobility systems: an updated survey
Annals of Operations Research | 2019-03-06 | Paper |
A new effective unified model for solving the pre-marshalling and block relocation problems
European Journal of Operational Research | 2018-07-25 | Paper |
Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
Discrete Optimization | 2018-05-24 | Paper |
Optimal Solution of Vehicle Routing Problems with Fractional Objective Function
| 2018-04-09 | Paper |
A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities
| 2017-02-14 | Paper |
A set covering approach for the double traveling salesman problem with multiple stacks
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Fast machine reassignment
Annals of Operations Research | 2016-11-07 | Paper |
Efficient computation of shortest paths in time-dependent multi-modal networks
ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
European Journal of Operational Research | 2016-10-06 | Paper |
The static bicycle relocation problem with demand intervals
European Journal of Operational Research | 2016-06-23 | Paper |
Shared mobility systems
4OR | 2016-01-13 | Paper |
Bike sharing systems: solving the static rebalancing problem
Discrete Optimization | 2014-04-15 | Paper |
Solving the electricity production planning problem by a column generation based heuristic
Journal of Scheduling | 2014-02-05 | Paper |
An exact algorithm for the two-echelon capacitated vehicle routing problem
Operations Research | 2013-07-02 | Paper |
The team orienteering problem with time windows: an LP-based granular variable neighborhood search
European Journal of Operational Research | 2012-12-29 | Paper |
UniALT for regular language contrained shortest paths on a multi-modal transportation network
| 2012-09-28 | Paper |
Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
Journal of Heuristics | 2012-05-08 | Paper |
An exact method for the capacitated location-routing problem
Operations Research | 2012-03-26 | Paper |
A matheuristic for the dial-a-ride problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
4OR | 2011-04-01 | Paper |
A Branch-and-Cut method for the Capacitated Location-Routing Problem
Computers \& Operations Research | 2011-01-31 | Paper |
An effective memetic algorithm for the cumulative capacitated vehicle routing problem
Computers \& Operations Research | 2010-06-11 | Paper |
Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
Annals of Operations Research | 2010-03-23 | Paper |
On the Complexity of the Multiple Stack TSP, kSTSP
Lecture Notes in Computer Science | 2009-06-03 | Paper |
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
Computers \& Operations Research | 2007-11-06 | Paper |
An effective and fast heuristic for the dial-a-ride problem
4OR | 2007-08-31 | Paper |
Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
4OR | 2007-01-24 | Paper |
A metaheuristic to solve a location-routing problem with nonlinear costs
Journal of Heuristics | 2006-05-29 | Paper |
A distributed geographic information system for the daily car pooling problem
Computers \& Operations Research | 2004-11-12 | Paper |
A heuristic approach to the overnight security service problem
Computers \& Operations Research | 2003-04-28 | Paper |
A heuristic for the vehicle routing problem with time windows
Journal of Heuristics | 2001-01-01 | Paper |
