A branch-and-cut algorithm for the windy profitable location rural postman problem

Cites Work

Unnamed Item
A survey of recent research on location-routing problems
A branch-and-cut algorithm for the profitable windy rural postman problem
The synchronized arc and node routing problem: application to road marking
Location-arc routing problem: heuristic approaches and test instances
A branch-and-cut algorithm for the orienteering arc routing problem
A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
Lower bounds and heuristics for the windy rural postman problem
Location-routing: issues, models and methods
The vehicle routing problem. Latest advances and new challenges.
Approximation algorithms for group prize-collecting and location-routing problems
New inequalities for the general routing problem
Combined location-routing problems: A synthesis and future research directions
A polyhedral approach to the rural postman problem
Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
The directed profitable location rural postman problem
The capacitated arc routing problem with refill points
The capacitated arc routing problem with intermediate facilities
Vehicle Routing
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
Odd Minimum Cut Sets and b-Matchings Revisited
An algorithm for the Rural Postman problem on a directed graph
Odd Minimum Cut-Sets and b-Matchings
Eulerian location problems
Arc Routing
A branch & cut algorithm for the windy general routing problem and special cases

This page was built for publication: A branch-and-cut algorithm for the windy profitable location rural postman problem