scientific article; zbMATH DE number 1568940

zbMATH Open0970.90071MaRDI QIDQ4762467FDOQ4762467

Richard Eglese, Adam N. Letchford

Publication date: 21 October 2001

Title of this publication is not available (Why is that?)

zbMATH Keywords

surveyarc routingpolyhedral theoryrural postman problemcapacitated arc routing problemchinese postman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Cited In (14)

• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing finest mincut partitions of a graph and application to routing problems
• Lower bounds for the mixed capacitated arc routing problem
• A GRASP heuristic for the mixed Chinese postman problem
• On a conjecture related to geometric routing
• A Decade of Capacitated Arc Routing
• A cutting plane algorithm for the capacitated arc routing problem
• Undirected postman problems with zigzagging option: a cutting-plane approach
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
• The capacitated arc routing problem with refill points
• On the general routing polytope
• Projection results for vehicle routing

Uses Software

• PORTA

Recommendations

• On the general routing polytope 👍 👎
• Arc Routing 👍 👎
• Polyhedral results for a vehicle routing problem 👍 👎
• The generalized arc routing problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

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