Eulerian location problems
From MaRDI portal
Publication:4934874
Recommendations
Cites work
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A polyhedral approach to the rural postman problem
- Approximating minimum-cost graph problems with spanning tree edges
- Approximation Algorithms for Some Postman Problems
- Improvement Procedures for the Undirected Rural Postman Problem
- Matching, Euler tours and the Chinese postman
Cited in
(18)- Anchored hyperplane location problems
- Location Science in Canada
- Some recent contributions to routing and location problems
- Airports and railways: facility location meets network design
- Location arc routing problem with inventory constraints
- Location-routing: issues, models and methods
- Location-arc routing problem: heuristic approaches and test instances
- Dynamic Location-routeing Problems
- A branch-and-cut algorithm for the windy profitable location rural postman problem
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- The directed profitable location rural postman problem
- The capacitated arc routing problem with refill points
- The aircraft maintenance base location problem
- A taxonomical analysis, current methods and objectives on location-routing problems
- The equitable location problem on the plane
- On approximate data reduction for the Rural Postman Problem: Theory and experiments
- Decomposition of the location problem
- Distribution network design on the battlefield
This page was built for publication: Eulerian location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934874)