A polynomial time solvable capacitated arc routing problem on regular grid graphs

DOI10.1002/NET.22262MaRDI QIDQ7012859zbMATH OpenFDO

Authors Qian Wan, Andreas T. Ernst, Rodolfo Garcia-Flores, Simon A. Bowly, Philip Kilby

Publication date 14 March 2025

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

zbMATH Keywords

multi-layerregular grid graphspolynomial-time solvablesingle-layercapacitated arc routing problem (CARP)solution patterns

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Transportation, logistics and supply chain management (90B06)

This page was built for publication: A polynomial time solvable capacitated arc routing problem on regular grid graphs

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