Multi-depot rural postman problems

DOI10.1007/S11750-016-0434-ZMaRDI QIDQ2408522zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

arc routingbinary formulationmulti-depot rural postman problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

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

Cites work

• scientific article; zbMATH DE number 2134188 (Why is no real title available?)
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem
• A branch-and-cut algorithm for the undirected rural postman problem
• A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
• A fundamental problem in vehicle routing
• A metaheuristic for the min-max windy rural postman problem with K vehicles
• A novel model for arc territory design: promoting Eulerian districts
• A polyhedral approach to the rural postman problem
• An algorithm for the Rural Postman problem on a directed graph
• An approach to the asymmetric multi-depot capacitated arc routing problem
• Arc routing problems with min-max objectives
• Capacitated arc routing problems
• District design for arc-routing applications
• Districting for arc routing
• Districting for salt spreading operations
• Improvement Procedures for the Undirected Rural Postman Problem
• Min-Max \(K\)-vehicles windy rural postman problem
• Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
• New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
• On general routing problems: Comments
• On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
• On the collaboration uncapacitated arc routing problem
• On the cycle polytope of a binary matroid
• Privatized rural postman problems
• Routing, districting and location for arc traversal problems. (Abstract of thesis).
• Solving the prize-collecting rural postman problem
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
• The capacitated arc routing problem: Valid inequalities and facets
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
• Variants of the capacitated arc routing problem
• Very Simple Methods for All Pairs Network Flow Analysis

Cited in

(9)

• 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
• Solution of real-world postman problems
• Min-Max \(K\)-vehicles windy rural postman problem
• Arc routing problems: A review of the past, present, and future
• The Steiner traveling salesman problem and its extensions

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)