Undirected postman problems with zigzagging option: a cutting-plane approach
From MaRDI portal
Recommendations
- A branch-and-cut algorithm for the undirected rural postman problem
- A cutting plane algorithm for the windy postman problem
- New results on the windy postman problem
- On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
Cites work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A branch-and-cut algorithm for the undirected rural postman problem
- A cutting plane algorithm for minimum perfect 2-matchings
- A Note on Postman Problems with Zigzag Service
- A polyhedral approach to the rural postman problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- scientific article; zbMATH DE number 1568940 (Why is no real title available?)
- Integer Programming and Combinatorial Optimization
- Matching, Euler tours and the Chinese postman
- Multi-Terminal Network Flows
- Odd Minimum Cut Sets and b-Matchings Revisited
- Odd Minimum Cut-Sets and b-Matchings
- Solving matching problems with linear programming
- The ellipsoid method and its consequences in combinatorial optimization
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
Cited in
(5)- The windy rural postman problem with a time-dependent zigzag option
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
- Recent results on arc routing problems: an annotated bibliography
- Hierarchical Chinese postman problem with fuzzy travel times
- A Note on Postman Problems with Zigzag Service
This page was built for publication: Undirected postman problems with zigzagging option: a cutting-plane approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925846)
