A branch-and-cut algorithm for the maximum benefit Chinese postman problem
DOI10.1007/S10107-011-0507-6zbMATH Open1295.90108OpenAlexW1997409263MaRDI QIDQ378087FDOQ378087
Authors: Isaac Plana, Antonio M. Rodríguez-Chía, Ángel Corberán, José M. Sanchis 
Publication date: 11 November 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0507-6
Recommendations
- An improved heuristic algorithm for the maximum benefit Chinese postman problem
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
- Approximate solutions for the maximum benefit chinese postman problem
- A branch-and-cut algorithm for the undirected rural postman problem
- An optimal algorithm for the mixed Chinese postman problem
Chinese postman problembranch-and-cutfacetsrural postman problemmaximum benefit Chinese postman problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- A fundamental problem in vehicle routing
- Solving the prize-collecting rural postman problem
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
- Privatized rural postman problems
- On general routing problems
- A polyhedral approach to the rural postman problem
- A branch-and-cut algorithm 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
- The undirected capacitated arc routing problem with profits
- Approximate solutions for the maximum benefit chinese postman problem
- On the cycle polytope of a binary matroid
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
- Odd Minimum Cut Sets and b-Matchings Revisited
- Transformation of Facets of the General Routing Problem Polytope
Cited In (18)
- An improved heuristic algorithm for the maximum benefit Chinese postman problem
- The periodic rural postman problem with irregular services on mixed graphs
- Multi-depot rural postman problems
- The directed profitable rural postman problem with incompatibility constraints
- The profitable close-enough arc routing problem
- City streets parking enforcement inspection decisions: the Chinese postman's perspective
- An updated annotated bibliography on arc routing problems
- Arc routing problems: A review of the past, present, and future
- Upgrading edges in the graphical TSP
- The multi‐purpose K‐drones general routing problem
- A branch-and-cut algorithm for the profitable windy rural postman problem
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
- Hierarchical Chinese postman problem with fuzzy travel times
- Approximate solutions for the maximum benefit chinese postman problem
- Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem
- The generalized arc routing problem
- Undirected postman problems with zigzagging option: a cutting-plane approach
- Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem
Uses Software
This page was built for publication: A branch-and-cut algorithm for the maximum benefit Chinese postman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378087)
