A branch-price-and-cut algorithm for the workover rig routing problem

DOI10.1016/j.cor.2012.04.010zbMath1349.90112OpenAlexW2016827346MaRDI QIDQ339692

Jacques Desrosiers, Glaydston Mattos Ribeiro, Guy Desaulniers

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.04.010

zbMATH Keywords

column generationvehicle routingbranch-price-and-cut\(ng\)-pathssubset-row inequalitiestabu search column generatorworkover rig routing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (4)

The discrete time window assignment vehicle routing problem ⋮ A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics ⋮ A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints

Cites Work

• Unnamed Item
• An exact solution framework for a broad class of vehicle routing problems
• Multi-depot vehicle scheduling problems with time windows and waiting costs
• A comparison of three metaheuristics for the workover rig routing problem
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Scheduling workover rigs for onshore oil production
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Cutting planes for branch-and-price algorithms
• The capacitated team orienteering and profitable tour problems
• Decomposition Principle for Linear Programs
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints

This page was built for publication: A branch-price-and-cut algorithm for the workover rig routing problem