An optimal algorithm for the mixed Chinese postman problem

DOI10.1002/(SICI)1097-0037(199603)27:2%3C97::AID-NET1%3E3.0.CO;2-8MaRDI QIDQ4887738zbMATH OpenOpenAlexFDO

Authors Jean-Claude Picard, Yves Nobert

Publication date 5 August 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199603)27:2%3C97::aid-net1%3E3.0.co;2-8

zbMATH Keywords

Chinese postman problemGomory cutsblossom inequalitiesbalanced set constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 3871059
• scientific article; zbMATH DE number 4208107
• Algorithms for the Chinese postman problem on mixed networks
• Finding postal carrier walk paths in mixed graphs
• A heuristic algorithm for the mixed Chinese postman problem

Cited in

(31)

• Chinese postman problem over 50 years
• scientific article; zbMATH DE number 6500999 (Why is no real title available?)
• scientific article; zbMATH DE number 3871059 (Why is no real title available?)
• A GRASP heuristic for the mixed Chinese postman problem
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem
• Uncertain multi-objective Chinese postman problem
• The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game
• scientific article; zbMATH DE number 3882483 (Why is no real title available?)
• Lower and upper bounds for the mixed capacitated arc routing problem
• The time-dependent rural postman problem: polyhedral results
• An approximation algorithm for solving the heterogeneous Chinese postman problem
• scientific article; zbMATH DE number 4023051 (Why is no real title available?)
• The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
• An integer programming approach for the Chinese postman problem with time-dependent travel time
• A comparison of two different formulations for arc routing problems on mixed graphs
• Approximation algorithms for multi-vehicle stacker crane problems
• Variants of the mixed postman problem solvable using linear programming
• A new algorithm for the directed Chinese postman problem
• Routing problems: A bibliography
• Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
• Algorithms for the Chinese postman problem on mixed networks
• Lower bounds for the mixed capacitated arc routing problem
• Approximate solutions for the maximum benefit chinese postman problem
• Two-phase branch-and-cut for the mixed capacitated general routing problem
• An algorithm for the hierarchical Chinese postman problem
• Arc routing problems: A review of the past, present, and future
• On the mixed Chinese postman problem
• Modeling and solving several classes of arc routing problems as traveling salesman problems
• scientific article; zbMATH DE number 124052 (Why is no real title available?)
• Approximation algorithms for solving the constrained arc routing problem in mixed graphs
• An improved heuristic algorithm for the maximum benefit Chinese postman problem

This page was built for publication: An optimal algorithm for the mixed Chinese postman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887738)