scientific article; zbMATH DE number 815126

MaRDI QIDQ4855437zbMATH OpenFDO

Authors Christoph Moll

Publication date 13 November 1995

zbMATH Keywords

disjoint paths problemgraph theoretic problemsinverse shortest path problemlinear programming dualityminimum cost multicommodity flow problemNP-completeNP-hardshortest path distancesshortest path problemweight function

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1341907
• Complexity of some inverse shortest path lengths problems
• An inverse problem of the weighted shortest path problem
• On an instance of the inverse shortest paths problem
• Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths

Cited in

(12)

• On an instance of the inverse shortest paths problem
• Shortest path calculation in large road networks
• Computation of the reverse shortest-path problem
• An inverse problem of the weighted shortest path problem
• Complexity of some inverse shortest path lengths problems
• Complexity of inverse shortest path routing
• Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
• scientific article; zbMATH DE number 1341907 (Why is no real title available?)
• scientific article; zbMATH DE number 1086909 (Why is no real title available?)
• A column generation method for inverse shortest path problems
• Inverse shortest path models based on fundamental cycle bases
• scientific article; zbMATH DE number 5031986 (Why is no real title available?)

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 Q4855437)