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

DOI10.1002/NET.3230260410zbMATH Open0856.90047OpenAlexW2014635906MaRDI QIDQ4894863FDOQ4894863

Authors: 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

Recommendations

• Finding the \(k\) shortest paths in parallel
• Finding the \(k\) shortest paths in parallel
• The shortest path in parallel
• scientific article; zbMATH DE number 56471
• Computational Science – ICCS 2005
• The robust shortest path problem in series -- parallel multidigraphs with interval data
• Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
• Fast approximate shortest paths in the congested clique

zbMATH Keywords

constrained shortest path problems

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The art and theory of dynamic programming

Cited In (4)

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

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

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