The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
type: Item
instance of: scholarly article
title: The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
zbMATH Open document ID: 1394.90543
author: Marco Colombi
author: Renata Mansini
author: Isaac Plana
author: Ángel Corberán
author: José M. Sanchis
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6872905
zbMATH Keywords: hierarchical routing problems
zbMATH Keywords: mixed rural postman problem
zbMATH Keywords: branch-and-cut
zbMATH Keywords: polyhedral analysis
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.07.026
OpenAlex ID: W2477194186
cites work: The stacker crane problem and the directed general routing problem
cites work: Q4762468
cites work: Solving the hierarchical Chinese postman problem as a rural postman problem.
cites work: Arc Routing
cites work: New Results on the Mixed General Routing Problem
cites work: A branch & cut algorithm for the windy general routing problem and special cases
cites work: The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
cites work: The mixed general routing polyhedron
cites work: Postman tour on a graph with precedence relation on arcs
cites work: An algorithm for the hierarchical Chinese postman problem
cites work: A branch-and-cut algorithm for the undirected rural postman problem
cites work: Solving matching problems with linear programming
cites work: On the hierarchical Chinese postman problem with linear ordered classes
cites work: Q5271450
cites work: The rural postman problem with deadline classes
cites work: Integer Programming and Combinatorial Optimization
cites work: Odd Minimum Cut-Sets and b-Matchings
DOI: 10.1016/J.EJOR.2016.07.026
Recommended article: A polyhedral approach to the rural postman problem
Recommended article: A branch-and-cut algorithm for the undirected rural postman problem
Recommended article: Heuristics for the mixed rural postman problem
Recommended article: The time-dependent rural postman problem: polyhedral results
Recommended article: A branch-and-bound algorithm for the time-dependent rural postman problem
Recommended article: A note on the undirected rural postman problem polytope
Recommended article: The Rural Postman Problem on mixed graphs with turn penalties
Recommended article: Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
Recommended article: A branch-and-cut algorithm for the profitable windy rural postman problem
Recommended article: On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
description: scientific article; zbMATH DE number 6872905