| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143302 | Operations Research Letters | 2007 | 7 Pages |
Abstract
A strongly polynomial time algorithm is described to solve the node-capacitated routing problem in an undirected ring network.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
András Frank, Zoltán Király, Balázs Kotnyek,