| Publication | Date of Publication | Type |
|---|
| Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning | 2024-03-26 | Paper |
| Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models | 2024-03-22 | Paper |
| Two‐stage stochastic one‐to‐many driver matching for ridesharing | 2024-01-18 | Paper |
| Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches | 2024-01-02 | Paper |
| A novel reformulation for the single-sink fixed-charge transportation problem | 2023-10-23 | Paper |
| Revue Des Inégalités Valides Pertinentes Aux Problèmes Des Conception De Réseaux | 2023-05-05 | Paper |
| Tabu Search With Exact Neighbor Evaluation For Multicommodity Location With Balancing Requirements | 2023-04-21 | Paper |
| On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations | 2023-03-27 | Paper |
| A Logistics Provider's Profit Maximization Facility Location Problem with Random Utility Maximizing Followers | 2023-03-12 | Paper |
| A Branch-and-Price Algorithm for the Multiple Knapsack Problem | 2023-01-11 | Paper |
| A Catalog of Formulations for the Network Pricing Problem | 2022-12-01 | Paper |
| A Lagrangian decomposition scheme for choice-based optimization | 2022-09-27 | Paper |
| A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements | 2022-06-22 | Paper |
| A taxonomy of multilayer network design and a survey of transportation and telecommunication applications | 2022-06-10 | Paper |
| An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model | 2022-03-18 | Paper |
| Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design | 2022-01-05 | Paper |
| Dynamic and stochastic rematching for ridesharing systems: formulations and reductions | 2021-02-04 | Paper |
| Quasi-separable Dantzig-Wolfe reformulations for network design | 2021-02-04 | Paper |
| Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel | 2020-05-26 | Paper |
| Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning | 2020-05-26 | Paper |
| Strong bounds for resource constrained project scheduling: preprocessing and cutting planes | 2019-11-11 | Paper |
| Revisiting Lagrangian relaxation for network design | 2019-05-17 | Paper |
| The \(p\)-arborescence star problem: formulations and exact solution approaches | 2018-12-03 | Paper |
| The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design | 2018-11-07 | Paper |
| A computational comparison of flow formulations for the capacitated location-routing problem | 2018-10-18 | Paper |
| A general variable neighborhood search for the swap-body vehicle routing problem | 2018-07-11 | Paper |
| Real-time management of transportation disruptions in forestry | 2018-07-11 | Paper |
| Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints | 2018-07-11 | Paper |
| Combining Benders decomposition and column generation for multi-activity tour scheduling | 2018-07-11 | Paper |
| Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design | 2018-05-30 | Paper |
| Multilayer variable neighborhood search for two‐level uncapacitated facility location problems with single assignment | 2018-05-23 | Paper |
| On the computational efficiency of subgradient methods: a case study with Lagrangian bounds | 2018-02-21 | Paper |
| Dynamic smoothness parameter for fast gradient methods | 2018-02-09 | Paper |
| Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities | 2017-12-29 | Paper |
| A two-stage stochastic programming approach for multi-activity tour scheduling | 2017-12-06 | Paper |
| A general variable neighborhood search variants for the travelling salesman problem with draft limits | 2017-11-10 | Paper |
| An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem | 2017-03-01 | Paper |
| Solving a dynamic facility location problem with partial closing and reopening | 2016-11-17 | Paper |
| Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem | 2016-11-10 | Paper |
| A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks | 2016-10-07 | Paper |
| Branch-and-Price for Personalized Multiactivity Tour Scheduling | 2016-08-12 | Paper |
| Modeling and solving a logging camp location problem | 2015-10-29 | Paper |
| Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design | 2015-01-28 | Paper |
| Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem | 2015-01-26 | Paper |
| A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem | 2014-08-18 | Paper |
| A stabilized structured Dantzig-Wolfe decomposition method | 2013-08-12 | Paper |
| A cutting plane algorithm for the capacitated connected facility location problem | 2013-08-08 | Paper |
| Accelerating benders decomposition with heuristicmaster problem solutions | 2013-01-28 | Paper |
| Total domination and the Caccetta-Häggkvist conjecture | 2012-12-28 | Paper |
| Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling | 2012-05-13 | Paper |
| A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems | 2012-02-19 | Paper |
| Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling | 2011-06-09 | Paper |
| Formal languages for integer programming modeling of shift scheduling problems | 2011-04-06 | Paper |
| Benders, metric and cutset inequalities for multicommodity capacitated network design | 2011-03-24 | Paper |
| Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs | 2009-08-13 | Paper |
| 0-1 reformulations of the multicommodity capacitated network design problem | 2009-06-23 | Paper |
| Modeling the Regular Constraint with Integer Programming | 2009-03-10 | Paper |
| Formulations and relaxations for a multi-echelon capacitated location-distribution problem | 2008-12-17 | Paper |
| On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem | 2008-09-10 | Paper |
| A sequential elimination algorithm for computing bounds on the clique number of a graph | 2008-08-15 | Paper |
| Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation | 2008-03-17 | Paper |
| Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs | 2008-03-12 | Paper |
| On edge orienting methods for graph coloring | 2007-10-12 | Paper |
| A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design | 2005-04-07 | Paper |
| A tabu search heuristic for scheduling the production processes at an oil refinery | 2004-11-11 | Paper |
| A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements | 2003-11-17 | Paper |
| Diversification strategies in local search for a nonbifurcated network loading problem | 2002-11-20 | Paper |
| Bundle-based relaxation methods for multicommodity capacitated fixed charge network design | 2002-07-30 | Paper |
| Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem | 2002-07-29 | Paper |
| A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem | 2002-06-16 | Paper |
| A branch-and-bound algorithm for depot location and container fleet management | 1999-08-05 | Paper |
| A parallel branch-and-bound algorithm for multicommodity location with balancing requirements | 1997-10-26 | Paper |
| Parallel Branch-and-Branch Algorithms: Survey and Synthesis | 1995-05-23 | Paper |
| Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements | 1994-02-17 | Paper |
