scientific article; zbMATH DE number 1305467
From MaRDI portal
Publication:4252354
zbMath0968.90066MaRDI QIDQ4252354
Jeyakesavan Veerasamy, Balaji Raghavachari
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear programmingcombinatorial optimizationapproximation algorithmswindy postman problemasymmetric postman problem
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Postman problems on series-parallel mixed graphs, On matchings, T‐joins, and arc routing in road networks, Feasibility of the Mixed Postman Problem with Restrictions on the Edges, The single robot line coverage problem: Theory, algorithms, and experiments, Approximation Algorithms for the Single Robot Line Coverage Problem