Min-Max K -vehicles windy rural postman problem
From MaRDI portal
Publication:3057121
DOI10.1002/net.20334zbMath1205.90239OpenAlexW4234983472MaRDI QIDQ3057121
Isaac Plana, José María Sanchis, Angel Corberán, Enrique Benavent
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20334
Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27) Connectivity (05C40)
Related Items (16)
Search games on networks with travelling and search costs and with arbitrary searcher starting points ⋮ Multi-depot rural postman problems ⋮ Heuristic and exact algorithms for a min-max selective vehicle routing problem ⋮ Approximation algorithms for the min-max mixed rural postmen cover problem and its variants ⋮ Approximation algorithms for the min-max mixed rural postmen cover problem and its variants ⋮ Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem ⋮ The periodic rural postman problem with irregular services on mixed graphs ⋮ Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ A metaheuristic for the min-max windy rural postman problem with K vehicles ⋮ A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem ⋮ New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem ⋮ Solving the prize-collecting rural postman problem ⋮ Profitable mixed capacitated arc routing and related problems ⋮ Search games on a network with travelling and search costs ⋮ The aircraft maintenance base location problem
Cites Work
- Unnamed Item
- Lower bounds and heuristics for the windy rural postman problem
- On the cycle polytope of a binary matroid
- The capacitated arc routing problem: Valid inequalities and facets
- A branch-and-cut algorithm for the undirected rural postman problem
- Solvable cases of the \(k\)-person Chinese postman problem
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
- The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
- An algorithm for the Rural Postman problem on a directed graph
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
- Capacitated arc routing problems
- Odd Minimum Cut-Sets and b-Matchings
- Arc Routing Problems, Part II: The Rural Postman Problem
- A branch & cut algorithm for the windy general routing problem and special cases
This page was built for publication: Min-Max K -vehicles windy rural postman problem
