|
|
|
A strongly polynomial time algorithm is described to solve the node-capacitated routing problem in an undirected ring network.
Bibtex entry:
| AUTHOR | = | {Frank, Andr{\'a}s and Kir{\'a}ly, Zolt{\'a}n and Kotnyek, Bal{\'a}zs}, |
| TITLE | = | {Algorithm for Node-Capacitated Ring Routing}, |
| NOTE | = | {{\tt www.cs.elte.hu/egres}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2006}, |
| NUMBER | = | {TR-2006-04} |