Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem

Cites Work

Unnamed Item
Unnamed Item
A branch-and-cut algorithm for the maximum benefit Chinese postman problem
An efficient algorithm for the minimum capacity cut problem
A cutting plane procedure for the travelling salesman problem on road networks
On the cycle polytope of a binary matroid
New inequalities for the general routing problem
The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
A polyhedral approach to the rural postman problem
On the possibility, to travel around a graph without repetition and without cutting
A branch-and-cut algorithm for the undirected rural postman problem
Implementing an efficient minimum capacity cut algorithm
On crossings, the Crossing Postman Problem, and the Rural Postman Problem
Recent results on Arc Routing Problems: An annotated bibliography
On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
Odd Minimum Cut Sets and b-Matchings Revisited
The traveling salesman problem on a graph and some related integer polyhedra
Multi-Terminal Network Flows
Odd Minimum Cut-Sets and b-Matchings
TSPLIB—A Traveling Salesman Problem Library
On general routing problems
A fundamental problem in vehicle routing
Improvement Procedures for the Undirected Rural Postman Problem
A branch & cut algorithm for the windy general routing problem and special cases
A cutting plane algorithm for the general routing problem
Arc routing problems: A review of the past, present, and future
An updated annotated bibliography on arc routing problems

This page was built for publication: Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem