The shortest path with at most / nodes in each of the series/parallel clusters

DOI10.1002/net.3230260410zbMath0856.90047OpenAlexW2014635906MaRDI QIDQ4894863

Wenjui Li, Osman Ulular, H.-S. Jacob Tsao

Publication date: 13 November 1996

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

constrained shortest path problems

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (3)

The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm ⋮ Shortest Paths in Graphs of Convex Sets ⋮ Generalized network design problems.

Cites Work

• The art and theory of dynamic programming
• Unnamed Item
• Unnamed Item

This page was built for publication: The shortest path with at most / nodes in each of the series/parallel clusters