Multi-depot rural postman problems
From MaRDI portal
Publication:2408522
DOI10.1007/S11750-016-0434-ZzbMATH Open1372.90014OpenAlexW2533404257MaRDI QIDQ2408522FDOQ2408522
Authors: 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
Recommendations
- A branch-and-cut algorithm for the undirected rural postman problem
- Min-Max \(K\)-vehicles windy rural postman problem
- scientific article; zbMATH DE number 2134188
- Solving the prize-collecting rural postman problem
- A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cites Work
- A fundamental problem in vehicle routing
- Solving the prize-collecting rural postman problem
- Privatized rural postman problems
- 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
- 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
- Districting for salt spreading operations
- New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
- Title not available (Why is that?)
- An approach to the asymmetric multi-depot capacitated arc routing problem
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- Improvement Procedures for the Undirected Rural Postman Problem
- District design for arc-routing applications
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- Districting for arc routing
- On the collaboration uncapacitated arc routing problem
- Very Simple Methods for All Pairs Network Flow Analysis
- On the cycle polytope of a binary matroid
- Min-Max \(K\)-vehicles windy rural postman problem
- On general routing problems: Comments
- A novel model for arc territory design: promoting Eulerian districts
- Arc routing problems with min-max objectives
- Variants of the capacitated arc routing problem
- A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
- A metaheuristic for the min-max windy rural postman problem with K vehicles
Cited In (9)
- Solution of real-world postman problems
- The Steiner traveling salesman problem and its extensions
- Arc routing problems: A review of the past, present, and future
- New path elimination constraints for multi-depot routing problems
- Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem
- 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
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
- Min-Max \(K\)-vehicles windy rural postman problem
This page was built for publication: Multi-depot rural postman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408522)
