| Publication | Date of Publication | Type |
|---|
A logistics provider's profit maximization facility location problem with random utility maximizing followers
Computers \& Operations Research | 2024-07-08 | Paper |
Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning
INFORMS Journal on Computing | 2024-03-26 | Paper |
Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models
INFORMS Journal on Computing | 2024-03-22 | Paper |
Two‐stage stochastic one‐to‐many driver matching for ridesharing
Networks | 2024-01-18 | Paper |
Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches
Discrete Applied Mathematics | 2024-01-02 | Paper |
A novel reformulation for the single-sink fixed-charge transportation problem
Mathematical Programming. Series A. Series B | 2023-10-23 | Paper |
Revue Des Inégalités Valides Pertinentes Aux Problèmes Des Conception De Réseaux
INFOR: Information Systems and Operational Research | 2023-05-05 | Paper |
Tabu Search With Exact Neighbor Evaluation For Multicommodity Location With Balancing Requirements
INFOR: Information Systems and Operational Research | 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
INFORMS Journal on Computing | 2023-01-11 | Paper |
A Catalog of Formulations for the Network Pricing Problem
INFORMS Journal on Computing | 2022-12-01 | Paper |
A Lagrangian decomposition scheme for choice-based optimization
Computers \& Operations Research | 2022-09-27 | Paper |
A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
Computers \& Operations Research | 2022-06-22 | Paper |
A taxonomy of multilayer network design and a survey of transportation and telecommunication applications
European Journal of Operational Research | 2022-06-10 | Paper |
An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model
European Journal of Operational Research | 2022-03-18 | Paper |
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
Discrete Applied Mathematics | 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
European Journal of Operational Research | 2020-05-26 | Paper |
Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning
Bioinspired Heuristics for Optimization | 2020-05-26 | Paper |
Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
Computers \& Operations Research | 2019-11-11 | Paper |
Revisiting Lagrangian relaxation for network design
Discrete Applied Mathematics | 2019-05-17 | Paper |
The \(p\)-arborescence star problem: formulations and exact solution approaches
Computers \& Operations Research | 2018-12-03 | Paper |
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
EURO Journal on Computational Optimization | 2018-11-07 | Paper |
A computational comparison of flow formulations for the capacitated location-routing problem
Discrete Optimization | 2018-10-18 | Paper |
Combining Benders decomposition and column generation for multi-activity tour scheduling
Computers \& Operations Research | 2018-07-11 | Paper |
A general variable neighborhood search for the swap-body vehicle routing problem
Computers \& Operations Research | 2018-07-11 | Paper |
Real-time management of transportation disruptions in forestry
Computers \& Operations Research | 2018-07-11 | Paper |
Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints
Computers \& Operations Research | 2018-07-11 | Paper |
Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
European Journal of Operational Research | 2018-05-30 | Paper |
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment
Networks | 2018-05-23 | Paper |
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
Mathematical Programming Computation | 2018-02-21 | Paper |
Dynamic smoothness parameter for fast gradient methods
Optimization Letters | 2018-02-09 | Paper |
Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities
INFORMS Journal on Computing | 2017-12-29 | Paper |
A two-stage stochastic programming approach for multi-activity tour scheduling
European Journal of Operational Research | 2017-12-06 | Paper |
A general variable neighborhood search variants for the travelling salesman problem with draft limits
Optimization Letters | 2017-11-10 | Paper |
An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
INFORMS Journal on Computing | 2017-03-01 | Paper |
Solving a dynamic facility location problem with partial closing and reopening
Computers \& Operations Research | 2016-11-17 | Paper |
Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
Computers \& Operations Research | 2016-11-10 | Paper |
A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
European Journal of Operational Research | 2016-10-07 | Paper |
Branch-and-price for personalized multiactivity tour scheduling
INFORMS Journal on Computing | 2016-08-12 | Paper |
Modeling and solving a logging camp location problem
Annals of Operations Research | 2015-10-29 | Paper |
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
EURO Journal on Computational Optimization | 2015-01-28 | Paper |
Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
INFORMS Journal on Computing | 2015-01-26 | Paper |
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem
Journal of Scheduling | 2014-08-18 | Paper |
A stabilized structured Dantzig-Wolfe decomposition method
Mathematical Programming. Series A. Series B | 2013-08-12 | Paper |
A cutting plane algorithm for the capacitated connected facility location problem
Computational Optimization and Applications | 2013-08-08 | Paper |
Accelerating Benders decomposition with heuristic master problem solutions
Pesquisa Operacional | 2013-01-28 | Paper |
Total domination and the Caccetta-Häggkvist conjecture
Discrete Optimization | 2012-12-28 | Paper |
Grammar-based integer programming models for multi-activity shift scheduling
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
Management Science | 2012-02-19 | Paper |
Grammar-based integer programming models for multiactivity shift scheduling
Management Science | 2011-06-09 | Paper |
Formal languages for integer programming modeling of shift scheduling problems
Constraints | 2011-04-06 | Paper |
Benders, metric and cutset inequalities for multicommodity capacitated network design
Computational Optimization and Applications | 2011-03-24 | Paper |
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
Operations Research | 2009-08-13 | Paper |
0-1 reformulations of the multicommodity capacitated network design problem
Discrete Applied Mathematics | 2009-06-23 | Paper |
Modeling the Regular Constraint with Integer Programming
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2009-03-10 | Paper |
Formulations and relaxations for a multi-echelon capacitated location-distribution problem
Computers \& Operations Research | 2008-12-17 | Paper |
On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem
Operations Research Letters | 2008-09-10 | Paper |
A sequential elimination algorithm for computing bounds on the clique number of a graph
Discrete Optimization | 2008-08-15 | Paper |
Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2008-03-17 | Paper |
Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
Networks | 2008-03-12 | Paper |
On edge orienting methods for graph coloring
Journal of Combinatorial Optimization | 2007-10-12 | Paper |
A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
Journal of Heuristics | 2005-04-07 | Paper |
A tabu search heuristic for scheduling the production processes at an oil refinery
International Journal of Production Research | 2004-11-11 | Paper |
A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
Annals of Operations Research | 2003-11-17 | Paper |
Diversification strategies in local search for a nonbifurcated network loading problem
European Journal of Operational Research | 2002-11-20 | Paper |
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Discrete Applied Mathematics | 2002-07-30 | Paper |
Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
Parallel Computing | 2002-07-29 | Paper |
A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
European Journal of Operational Research | 2002-06-16 | Paper |
Tabu search for a network loading problem with multiple facilities
Journal of Heuristics | 2001-10-01 | Paper |
A branch-and-bound algorithm for depot location and container fleet management
Location Science | 1999-08-05 | Paper |
A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
Computers \& Operations Research | 1997-10-26 | Paper |
Parallel Branch-and-Branch Algorithms: Survey and Synthesis
Operations Research | 1995-05-23 | Paper |
Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements
INFOR: Information Systems and Operational Research | 1994-02-17 | Paper |
