Multi-depot rural postman problems
From MaRDI portal
Publication:2408522
DOI10.1007/s11750-016-0434-zzbMath1372.90014OpenAlexW2533404257MaRDI QIDQ2408522
Elena Fernández, Jessica Rodríguez-Pereira
Publication date: 12 October 2017
Published in: Top (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/114231
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (4)
Compact formulations for multi-depot routing problems: theoretical and computational comparisons ⋮ The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods ⋮ Arc routing problems: A review of the past, present, and future ⋮ The Steiner traveling salesman problem and its extensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approach to the asymmetric multi-depot capacitated arc routing problem
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- On the collaboration uncapacitated arc routing problem
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- A metaheuristic for the min-max windy rural postman problem with K vehicles
- Solving the prize-collecting rural postman problem
- On the cycle polytope of a binary matroid
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
- A polyhedral approach to the rural postman problem
- The capacitated arc routing problem: Valid inequalities and facets
- Routing, districting and location for arc traversal problems. (Abstract of thesis).
- A branch-and-cut algorithm for the undirected rural postman problem
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- Districting for salt spreading operations
- Privatized rural postman problems
- A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem
- A novel model for arc territory design: promoting Eulerian districts
- Districting for Arc Routing
- 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
- Very Simple Methods for All Pairs Network Flow Analysis
- On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
- An algorithm for the Rural Postman problem on a directed graph
- Capacitated arc routing problems
- On general routing problems: Comments
- A fundamental problem in vehicle routing
- Improvement Procedures for the Undirected Rural Postman Problem
- District design for arc-routing applications
This page was built for publication: Multi-depot rural postman problems
