A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem

DOI10.1007/978-3-642-38756-2_18zbMath1303.90091OpenAlexW7322787MaRDI QIDQ5405927

Jinghao Sun, Yakun Meng, Guozhen Tan

Publication date: 3 April 2014

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38756-2_18

zbMATH Keywords

cutting planeheuristic algorithmtime dependentChinese postman problempolyhedral theory

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Solving the time varying postman problems with timed automata

This page was built for publication: A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem