An optimal algorithm for the mixed Chinese postman problem

DOI10.1002/(SICI)1097-0037(199603)27:2%3C97::AID-NET1%3E3.0.CO;2-8zbMATH Open0851.90128OpenAlexW1968384435MaRDI QIDQ4887738FDOQ4887738

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

Recommendations

• scientific article; zbMATH DE number 3871059
• scientific article
• 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

zbMATH Keywords

Chinese postman problemGomory cutsblossom inequalitiesbalanced set constraints

Mathematics Subject Classification ID

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

Cited In (31)

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