| Publication | Date of Publication | Type |
|---|
Stochastic production-distribution planning with transportation mode-dependent lead times
Computers & Operations Research | 2026-05-11 | Paper |
A survey of workforce scheduling and routing problems
Computers & Operations Research | 2026-05-04 | Paper |
Electric vehicle routing with heterogeneous charging stations
Computers & Operations Research | 2026-05-04 | Paper |
Facility location with modular capacity under demand uncertainty: an industrial case study
INFOR: Information Systems and Operational Research | 2025-12-19 | Paper |
Satellite scheduling problems: a survey of applications in Earth and outer space observation
Computers & Operations Research | 2025-05-26 | Paper |
A progressive hedging-based matheuristic for the stochastic production routing problem with adaptive routing
Computers & Operations Research | 2025-05-26 | Paper |
An updated survey of attended home delivery and service problems with a focus on applications
Annals of Operations Research | 2025-02-07 | Paper |
The workforce scheduling and routing problem with park-and-loop
Networks | 2025-01-15 | Paper |
A hybrid adaptive iterated local search heuristic for the maximal covering location problem
International Transactions in Operational Research | 2024-09-24 | Paper |
AILS-II: an adaptive iterated local search heuristic for the large-scale capacitated vehicle routing problem
INFORMS Journal on Computing | 2024-09-05 | Paper |
One-shot learning for MIPs with SOS1 constraints
SN Operations Research Forum | 2024-07-25 | Paper |
Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs
Computers & Operations Research | 2024-06-06 | Paper |
A Numerically Exact Algorithm for the Bin-Packing Problem
INFORMS Journal on Computing | 2024-03-26 | Paper |
A survey of attended home delivery and service problems with a focus on applications
4OR | 2024-01-23 | Paper |
| Pseudo-random Instance Generators in C++ for Deterministic and Stochastic Multi-commodity Network Design Problems | 2023-12-17 | Paper |
The consistent production routing problem
Networks | 2023-12-12 | Paper |
Split demand and deliveries in an integrated three-level lot sizing and replenishment problem
Computers & Operations Research | 2023-11-15 | Paper |
Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen
Computers & Operations Research | 2023-11-13 | Paper |
Un algorithme de minimisation du transport à vide appliqué à l'industrie forestière
INFOR: Information Systems and Operational Research | 2023-05-09 | Paper |
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
INFOR: Information Systems and Operational Research | 2023-05-09 | Paper |
Étude comparative de divers modèles pour le problème de transport à la demande
INFOR: Information Systems and Operational Research | 2023-05-09 | Paper |
Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique
INFOR: Information Systems and Operational Research | 2023-05-09 | Paper |
Locating Satellite Yards in Forestry Operations
INFOR: Information Systems and Operational Research | 2023-05-09 | Paper |
Steiner Tree Problems With Profits
INFOR: Information Systems and Operational Research | 2023-05-05 | Paper |
Un Modèle Pour La Conception D’Un Réseau De Distribution Avec Localisation, Aefectation Et Stocks
INFOR: Information Systems and Operational Research | 2023-05-05 | Paper |
A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows
INFOR: Information Systems and Operational Research | 2023-04-24 | Paper |
Solving the vessel routing and scheduling problem at a Canadian maritime transportation company
INFOR: Information Systems and Operational Research | 2023-03-20 | Paper |
Heuristics for electric taxi fleet management at Teo Taxi
INFOR: Information Systems and Operational Research | 2023-03-20 | Paper |
Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution
INFORMS Journal on Computing | 2023-01-11 | Paper |
An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
Computers & Operations Research | 2022-09-27 | Paper |
Vessel service planning in seaports
Operations Research | 2022-09-19 | Paper |
The doubly open park-and-loop routing problem
Computers & Operations Research | 2022-06-22 | Paper |
| AILS-II: An Adaptive Iterated Local Search Heuristic for the Large-scale Capacitated Vehicle Routing Problem | 2022-05-24 | Paper |
The transit time constrained fixed charge multi-commodity network design problem
Computers & Operations Research | 2022-03-09 | Paper |
A time-space formulation for the locomotive routing problem at the Canadian National Railways
Computers & Operations Research | 2022-03-09 | Paper |
An Adaptive Iterated Local Search Heuristic for the Heterogeneous Fleet Vehicle Routing Problem
(available as arXiv preprint) | 2021-11-24 | Paper |
Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure
European Journal of Operational Research | 2021-06-04 | Paper |
A unified decomposition matheuristic for assembly, production, and inventory routing
INFORMS Journal on Computing | 2020-12-02 | Paper |
Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products
European Journal of Operational Research | 2020-01-23 | Paper |
A branch-and-cut algorithm for an assembly routing problem
European Journal of Operational Research | 2020-01-23 | Paper |
Waste collection inventory routing with non-stationary stochastic demands
Computers & Operations Research | 2019-11-11 | Paper |
Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
Computers & Operations Research | 2019-09-25 | Paper |
A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure
Computers & Operations Research | 2019-09-25 | Paper |
Benders decomposition for very large scale partial set covering and maximal covering location problems
European Journal of Operational Research | 2019-02-11 | Paper |
Solving the wire-harness design problem at a European car manufacturer
European Journal of Operational Research | 2018-10-30 | Paper |
A computational comparison of flow formulations for the capacitated location-routing problem
Discrete Optimization | 2018-10-18 | Paper |
A decomposition heuristic for a rich production routing problem
Computers & Operations Research | 2018-07-12 | Paper |
Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
Computers & Operations Research | 2018-07-11 | Paper |
Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds
European Journal of Operational Research | 2018-05-25 | Paper |
Scheduling identical parallel machines with tooling constraints
European Journal of Operational Research | 2018-05-24 | Paper |
Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities
INFORMS Journal on Computing | 2017-12-29 | Paper |
An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
INFORMS Journal on Computing | 2017-03-01 | Paper |
Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
INFORMS Journal on Computing | 2017-03-01 | Paper |
A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem
Computers & Operations Research | 2016-11-17 | Paper |
Solving a dynamic facility location problem with partial closing and reopening
Computers & Operations Research | 2016-11-17 | Paper |
An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
Computers & Operations Research | 2016-11-11 | Paper |
Heuristics for dynamic and stochastic routing in industrial shipping
Computers & Operations Research | 2016-11-11 | Paper |
A branch-price-and-cut method for a ship routing and scheduling problem with split loads
Computers & Operations Research | 2016-11-11 | Paper |
The production routing problem: a review of formulations and solution algorithms
Computers & Operations Research | 2016-11-10 | Paper |
Heuristics for dynamic and stochastic inventory-routing
Computers & Operations Research | 2016-11-10 | Paper |
Tactical network planning for food aid distribution in Kenya
Computers & Operations Research | 2016-11-10 | Paper |
Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
Computers & Operations Research | 2016-11-10 | Paper |
Simulation-based optimization for housekeeping in a container transshipment terminal
Computers & Operations Research | 2016-11-10 | Paper |
A decomposition-based heuristic for the multiple-product inventory-routing problem
Computers & Operations Research | 2016-11-10 | Paper |
Exact and heuristic algorithms for the design of hub networks with multiple lines
European Journal of Operational Research | 2016-10-06 | Paper |
A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
INFORMS Journal on Computing | 2016-06-29 | Paper |
Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem
European Journal of Operational Research | 2016-06-24 | Paper |
Benders decomposition for production routing under demand uncertainty
Operations Research | 2016-01-22 | Paper |
Modeling and solving a logging camp location problem
Annals of Operations Research | 2015-10-29 | Paper |
An exact algorithm for the capacitated arc routing problem with deadheading demand
Operations Research | 2013-07-02 | Paper |
Improved lower bounds and exact algorithm for the capacitated arc routing problem
Mathematical Programming. Series A. Series B | 2013-03-18 | Paper |
Accelerating Benders decomposition with heuristic master problem solutions
Pesquisa Operacional | 2013-01-28 | Paper |
The inventory-routing problem with transshipment
Computers & Operations Research | 2012-11-15 | Paper |
Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
OR Spectrum | 2012-08-13 | Paper |
Accelerating Benders decomposition by local branching
INFORMS Journal on Computing | 2012-07-28 | Paper |
Benders decomposition for large-scale uncapacitated hub location
Operations Research | 2012-06-26 | Paper |
The delivery man problem with time windows
Discrete Optimization | 2012-06-20 | Paper |
Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
INFORMS Journal on Computing | 2012-06-18 | Paper |
A memetic heuristic for the generalized quadratic assignment problem
INFORMS Journal on Computing | 2012-06-18 | Paper |
Stochastic uncapacitated hub location
European Journal of Operational Research | 2012-05-14 | Paper |
Optimizing yard assignment in an automotive transshipment terminal
European Journal of Operational Research | 2012-05-14 | Paper |
Solving variants of the vehicle routing problem with a simple parallel iterated tabu search
Lecture Notes in Computer Science | 2011-09-09 | Paper |
An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
Discrete Applied Mathematics | 2011-06-01 | Paper |
Benders, metric and cutset inequalities for multicommodity capacitated network design
Computational Optimization and Applications | 2011-03-24 | Paper |
Modeling and solving a multimodal transportation problem with flexible-time and scheduled services
Networks | 2011-02-17 | Paper |
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
Networks | 2010-11-24 | Paper |
A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
Discrete Applied Mathematics | 2010-11-05 | Paper |
Scheduling technicians and tasks in a telecommunications company
Journal of Scheduling | 2010-10-08 | Paper |
Recent models and algorithms for one-to-one pickup and delivery problems
Operations Research/Computer Science Interfaces | 2010-06-02 | Paper |
Implicit shift scheduling with multiple breaks and work stretch duration restrictions
Journal of Scheduling | 2010-05-07 | Paper |
The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
Computers & Operations Research | 2009-12-22 | Paper |
The attractive traveling salesman problem
European Journal of Operational Research | 2009-12-07 | Paper |
Dynamic pickup and delivery problems
European Journal of Operational Research | 2009-11-17 | Paper |
A tabu search heuristic for the quay crane scheduling problem
Journal of Scheduling | 2009-08-28 | Paper |
A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
Journal of Scheduling | 2009-08-28 | Paper |
A two-level simulated annealing algorithm for efficient dissemination of electronic content
The Journal of the Operational Research Society | 2009-08-28 | Paper |
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Operations Research | 2009-08-13 | Paper |
Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
Networks | 2009-07-28 | Paper |
Simultaneous Assignment of Locomotives and Cars to Passenger Trains
Operations Research | 2009-07-03 | Paper |
A column generation heuristic for a dynamic generalized assignment problem
Computers & Operations Research | 2009-04-03 | Paper |
The pickup and delivery traveling salesman problem with first-in-first-out loading
Computers & Operations Research | 2009-02-12 | Paper |
Solution approaches to large shift scheduling problems
RAIRO - Operations Research | 2008-11-19 | Paper |
Solution approaches to large shift scheduling problems
RAIRO - Operations Research | 2008-11-19 | Paper |
A tabu search heuristic for the generalized minimum spanning tree problem
European Journal of Operational Research | 2008-07-21 | Paper |
Iterated tabu search for the car sequencing problem
European Journal of Operational Research | 2008-07-10 | Paper |
Exact algorithms for the joint object placement and request routing problem in content distribution networks
Computers & Operations Research | 2008-05-23 | Paper |
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
European Journal of Operational Research | 2008-04-24 | Paper |
The dial-a-ride problem: Models and algorithms
Annals of Operations Research | 2008-03-31 | Paper |
A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
Computers & Operations Research | 2008-02-22 | Paper |
| New heuristics for the vehicle routing problem | 2008-01-02 | Paper |
Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
Top | 2007-08-31 | Paper |
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
Networks | 2007-07-30 | Paper |
A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
Naval Research Logistics | 2007-02-20 | Paper |
An integrated model for logistics network design
Annals of Operations Research | 2007-02-15 | Paper |
A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
European Journal of Operational Research | 2006-12-07 | Paper |
The service allocation problem at the Gioia Tauro maritime terminal
European Journal of Operational Research | 2006-11-15 | Paper |
The multi-depot vehicle routing problem with inter-depot routes
European Journal of Operational Research | 2006-11-15 | Paper |
| Modeling and optimization of vehicle routing and arc routing problems | 2006-10-17 | Paper |
| scientific article; zbMATH DE number 2209651 (Why is no real title available?) | 2005-09-28 | Paper |
Maximizing the value of an Earth observation satellite orbit
The Journal of the Operational Research Society | 2005-09-01 | Paper |
Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
The Journal of the Operational Research Society | 2005-04-04 | Paper |
A unified tabu search heuristic for vehicle routing problems with time windows
The Journal of the Operational Research Society | 2005-03-16 | Paper |
| A guide to vehicle routing heuristics | 2005-03-14 | Paper |
A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
Computers & Operations Research | 2005-02-22 | Paper |
Scheduling linen deliveries in a large hospital
The Journal of the Operational Research Society | 2005-01-19 | Paper |
Using Benders decomposition to implicitly model tour scheduling
Annals of Operations Research | 2004-08-10 | Paper |
The dial-a-ride problem (DARP): variants, modeling issues and algorithms
4OR | 2004-06-11 | Paper |
A Benders decomposition approach for the locomotive and car assignment problem
Transportation Science | 2002-10-17 | Paper |
Close-Point Spatial Tests and Their Application to Random Number Generators
Operations Research | 2002-06-04 | Paper |
A survey of optimization models for train routing and scheduling
Transportation Science | 2002-04-17 | Paper |
| scientific article; zbMATH DE number 1749226 (Why is no real title available?) | 2002-01-01 | Paper |
Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
Transportation Science | 2001-01-01 | Paper |
| A tabu search heuristic for periodic and multi-depot vehicle routing problems | 1997-10-26 | Paper |
One-shot Learning for MIPs with SOS1 Constraints
(available as arXiv preprint) | N/A | Paper |
