scientific article; zbMATH DE number 1340882

DOI10.1002/(SICI)1097-0037(199908)34:1%3C19::AID-NET3%3E3.0.CO;2-6zbMATH Open0959.90013MaRDI QIDQ4262692

S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi

Publication date: 6 May 2001

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

zbMATH Keywords

complexity resultspath problems in networks

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)

Cites Work

• Title not available (Why is that?)

Related Items (4)

Title not available (Why is that?) ⋮ Path Problems in Complex Networks ⋮ Title not available (Why is that?) ⋮ Shortest paths in networks with vector weights

Recommendations

• Shortest paths in networks with vector weights 👍 👎
• Shortest path problem on a network with imprecise edge weight 👍 👎
• Shortest path network problems with stochastic arc weights 👍 👎
• Path problems in networks 👍 👎
• Path Problems in Complex Networks 👍 👎
• Path Problems in Structured Graphs 👍 👎
• 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 Q4262692)