New lower bounds for the Capacitated Arc Routing Problem

DOI10.1002/NET.3230180305MaRDI QIDQ3802908zbMATH OpenOpenAlexFDO

Authors Wen Lea Pearn

Publication date 1988

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

Capacitated Arc Routing ProblemChinese postmanfleet of vehiclesMatching Lower Boundminimal costNodes Scanning Lower Boundundirected network

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• New lower bound for the capacitated arc routing problem
• The Capacitated Arc Routing Problem: Lower bounds
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• The capacitated arc routing problem: combinatorial lower bounds
• Lower bounds for the mixed capacitated arc routing problem
• Lower and upper bounds for the mixed capacitated arc routing problem
• Improved bounds for large scale capacitated arc routing problem
• An approximation algorithm for the capacitated arc routing problem
• The capacitated arc routing problem: Valid inequalities and facets
• The capacitated arc routing problem: exact algorithms

Cites work

• Approximate solutions for the capacitated arc routing problem
• Transforming arc routing into node routing problems

Cited in

(20)

• The capacitated arc routing problem: Valid inequalities and facets
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• A cutting plane algorithm for the capacitated arc routing problem
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
• Robust drone selective routing in humanitarian transportation network assessment
• Lower and upper bounds for the mixed capacitated arc routing problem
• New lower bound for the capacitated arc routing problem
• Solving capacitated arc routing problems using a transformation to the CVRP
• Improved bounds for large scale capacitated arc routing problem
• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• A lower bound for the node, edge, and arc routing problem
• NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
• The Capacitated Arc Routing Problem: Lower bounds
• The capacitated arc routing problem: combinatorial lower bounds
• scientific article; zbMATH DE number 232390 (Why is no real title available?)
• New upper bounds for the multi-depot capacitated arc routing problem
• Approximate solutions for the maximum benefit chinese postman problem
• On matchings, T‐joins, and arc routing in road networks
• The open capacitated arc routing problem

This page was built for publication: New lower bounds for the Capacitated Arc Routing Problem

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