On matchings, T‐joins, and arc routing in road networks

DOI10.1002/net.22033OpenAlexW3133555330MaRDI QIDQ6065851

Adam N. Letchford, Thu Huong Dang, Burak Boyacı

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationmatchingarc routing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Routeing winter gritting vehicles
• Lower and upper bounds for the mixed capacitated arc routing problem
• New lower bound for the capacitated arc routing problem
• The capacitated arc routing problem with intermediate facilities
• New lower bounds for the Capacitated Arc Routing Problem
• A Separator Theorem for Planar Graphs
• Applications of a Planar Separator Theorem
• Capacitated arc routing problems
• NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
• The Capacitated Arc Routing Problem: Lower bounds
• Data Structures for Weighted Matching and Extensions to b -matching and f -factors
• Scaling Algorithms for Weighted Matching in General Graphs
• A 3/2-Approximation Algorithm for the Mixed Postman Problem
• Matching, Euler tours and the Chinese postman
• Fibonacci heaps and their uses in improved network optimization algorithms
• Implementation of O ( nm log n ) weighted matchings in general graphs
• Maximum matching and a polyhedron with 0,1-vertices
• Faster shortest-path algorithms for planar graphs
• Combinatorial optimization. Theory and algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item