The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
From MaRDI portal
Publication:1752763
DOI10.1016/j.ejor.2016.07.026zbMath1394.90543OpenAlexW2477194186MaRDI QIDQ1752763
Renata Mansini, Marco Colombi, Isaac Plana, José María Sanchis, Angel Corberán
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.07.026
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
The target visitation arc routing problem ⋮ Hierarchical Chinese postman problem with fuzzy travel times ⋮ The directed profitable rural postman problem with incompatibility constraints
Cites Work
- Unnamed Item
- Unnamed Item
- The rural postman problem with deadline classes
- The mixed general routing polyhedron
- Solving the hierarchical Chinese postman problem as a rural postman problem.
- A branch-and-cut algorithm for the undirected rural postman problem
- An algorithm for the hierarchical Chinese postman problem
- On the hierarchical Chinese postman problem with linear ordered classes
- The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
- Solving matching problems with linear programming
- Postman tour on a graph with precedence relation on arcs
- Odd Minimum Cut-Sets and b-Matchings
- The stacker crane problem and the directed general routing problem
- Arc Routing
- A branch & cut algorithm for the windy general routing problem and special cases
- New Results on the Mixed General Routing Problem
- Integer Programming and Combinatorial Optimization
This page was built for publication: The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
