A branch-price-and-cut algorithm for the workover rig routing problem
DOI10.1016/J.COR.2012.04.010zbMATH Open1349.90112OpenAlexW2016827346MaRDI QIDQ339692FDOQ339692
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
Recommendations
- A comparison of three metaheuristics for the workover rig routing problem
- Models and hybrid methods for the onshore wells maintenance problem
- Scheduling workover rigs for onshore oil production
- A hybrid algorithm for the drilling rig routing problem
- Exact and hybrid methods for the multiperiod field service routing problem
column generationvehicle routingbranch-price-and-cut\(ng\)-pathssubset-row inequalitiestabu search column generatorworkover rig routing
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Title not available (Why is that?)
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- 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
- Multi-depot vehicle scheduling problems with time windows and waiting costs
- Decomposition Principle for Linear Programs
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- New route relaxation and pricing strategies for the vehicle routing problem
- The capacitated team orienteering and profitable tour problems
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- A comparison of three metaheuristics for the workover rig routing problem
- Cutting planes for branch-and-price algorithms
- An exact solution framework for a broad class of vehicle routing problems
- Scheduling workover rigs for onshore oil production
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
Cited In (5)
- Scheduling workover rigs for onshore oil production
- A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics
- 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
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
This page was built for publication: A branch-price-and-cut algorithm for the workover rig routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339692)
