A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem
From MaRDI portal
Publication:2811322
DOI10.1002/net.21520zbMath1348.90533OpenAlexW2163513576MaRDI QIDQ2811322
Guy Desaulniers, Angel Corberán, Enrique Benavent, Isaac Plana, José María Sanchis, François Lessard
Publication date: 10 June 2016
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21520
column generationcutting planesrural postman problembranch-and-pricewindy rural postman problemmultivehicle
Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (3)
Multi-depot rural postman problems ⋮ A generic exact solver for vehicle routing and related problems ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows
Cites Work
- A metaheuristic for the min-max windy rural postman problem with K vehicles
- Solvable cases of the \(k\)-person Chinese postman problem
- 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
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Min-Max K -vehicles windy rural postman problem
- New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
- Cutting planes for branch-and-price algorithms
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
- Odd Minimum Cut-Sets and b-Matchings
- A fundamental problem in vehicle routing
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- 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 min-maxk-vehicle windy rural postman problem
