- Home
- Publications
- Publication Search
- Publication Details
Title
A generic exact solver for vehicle routing and related problems
Authors
Keywords
-
Journal
MATHEMATICAL PROGRAMMING
Volume -, Issue -, Pages -
Publisher
Springer Science and Business Media LLC
Online
2020-06-25
DOI
10.1007/s10107-020-01523-z
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Comparative Analysis of Capacitated Arc Routing Formulations for Designing a New Branch-Cut-and-Price Algorithm
- (2019) Diego Pecin et al. TRANSPORTATION SCIENCE
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- (2019) Guillaume Marques et al. COMPUTERS & OPERATIONS RESEARCH
- A branch-and-price algorithm for the Minimum Latency Problem
- (2018) Teobaldo Bulhões et al. COMPUTERS & OPERATIONS RESEARCH
- The vehicle routing problem with service level constraints
- (2018) Teobaldo Bulhões et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
- (2018) Timo Gschwind et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems
- (2018) Artur Pessoa et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Stabilized branch-and-price algorithms for vector packing problems
- (2018) Katrin Heßler et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- On the complete set packing and set partitioning polytopes: Properties and rank 1 facets
- (2018) Teobaldo Bulhões et al. OPERATIONS RESEARCH LETTERS
- Algorithms for non-linear and stochastic resource constrained shortest path
- (2018) Axel Parmentier MATHEMATICAL METHODS OF OPERATIONS RESEARCH
- Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem
- (2017) Luis Gouveia et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- (2017) François Clautiaux et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- New benchmark instances for the Capacitated Vehicle Routing Problem
- (2017) Eduardo Uchoa et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- An abstract model for branching and its application to mixed integer programming
- (2017) Pierre Le Bodic et al. MATHEMATICAL PROGRAMMING
- Limited memory Rank-1 Cuts for Vehicle Routing Problems
- (2017) Diego Pecin et al. OPERATIONS RESEARCH LETTERS
- JuMP: A Modeling Language for Mathematical Optimization
- (2017) Iain Dunning et al. SIAM REVIEW
- A branch-and-cut algorithm for the Team Orienteering Problem
- (2017) Nicola Bianchessi et al. International Transactions in Operational Research
- Solving the team orienteering problem with cutting planes
- (2016) Racha El-Hajj et al. COMPUTERS & OPERATIONS RESEARCH
- Bin packing and related problems: General arc-flow formulation with graph compression
- (2016) Filipe Brandão et al. COMPUTERS & OPERATIONS RESEARCH
- Bin packing and cutting stock problems: Mathematical models and exact algorithms
- (2016) Maxence Delorme et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- (2014) Claudio Contardo et al. Discrete Optimization
- A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem
- (2013) Enrique Benavent et al. NETWORKS
- Dynamic ng-Path Relaxation for the Delivery Man Problem
- (2013) Roberto Roberti et al. TRANSPORTATION SCIENCE
- Optimal solutions for routing problems with profits
- (2012) C. Archetti et al. DISCRETE APPLIED MATHEMATICS
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
- (2012) Claudia Bode et al. OPERATIONS RESEARCH
- An exact method with variable fixing for solving the generalized assignment problem
- (2011) Marius Posta et al. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- (2011) Enrico Bartolini et al. MATHEMATICAL PROGRAMMING
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- (2011) Roberto Baldacci et al. OPERATIONS RESEARCH
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- (2011) Roberto Baldacci et al. OPERATIONS RESEARCH
- Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
- (2009) Stefan Ropke et al. TRANSPORTATION SCIENCE
- A computational study of exact knapsack separation for the generalized assignment problem
- (2008) Pasquale Avella et al. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
- The capacitated team orienteering and profitable tour problems
- (2008) C Archetti et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- A unified exact method for solving different classes of vehicle routing problems
- (2008) Roberto Baldacci et al. MATHEMATICAL PROGRAMMING
- Tabu Search, Partial Elementarity, and Generalizedk-Path Inequalities for the Vehicle Routing Problem with Time Windows
- (2008) Guy Desaulniers et al. TRANSPORTATION SCIENCE
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- (2007) Mads Jepsen et al. OPERATIONS RESEARCH
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreFind the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
Search