Plowing with precedence in polynomial time

DOI10.1002/net.21987OpenAlexW3081818585MaRDI QIDQ6092637

F. J. Zaragoza Martínez, Unnamed Author, Unnamed Author

Publication date: 23 November 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21987

zbMATH Keywords

computational complexitycost structurearc routingprecedencesnow plowingwindy postman problemmultiple plows

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Plowing with precedence: a variant of the windy postman problem
• On the windy postman problem
• Lower bounds and heuristics for the windy rural postman problem
• On the windy postman problem on Eulerian graphs
• The ellipsoid method and its consequences in combinatorial optimization
• A cutting plane algorithm for the windy postman problem
• New heuristic algorithms for the windy rural postman problem
• Series-parallel graphs are windy postman perfect
• The Chinese Postman Problem for Mixed Networks
• Odd Minimum Cut-Sets and b-Matchings
• P-Complete Approximation Problems
• Reducibility among Combinatorial Problems
• A branch & cut algorithm for the windy general routing problem and special cases

This page was built for publication: Plowing with precedence in polynomial time