Algorithms for Path-Based Placement of Inspection Stations on Networks

DOI10.1287/IJOC.12.2.136.11895MaRDI QIDQ4427327zbMATH OpenOpenAlexFDO

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

Publication date 2000

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.12.2.136.11895

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)

Recommendations

• Publication:4488781
• Minisum amd minimax paths of a moving facility on a network
• scientific article; zbMATH DE number 1688370
• The Inspection Station Location Problem In Hazardous Material Transportation: Some Heuristics And Bounds
• Specialized inspection problems in serial production systems

Cited in

(5)

• Algorithms for placing monitors in a flow network
• scientific article; zbMATH DE number 1688370 (Why is no real title available?)
• scientific article; zbMATH DE number 1471488 (Why is no real title available?)
• The Inspection Station Location Problem In Hazardous Material Transportation: Some Heuristics And Bounds
• Flow intercepting facility location: Problems, models and heuristics

This page was built for publication: Algorithms for Path-Based Placement of Inspection Stations on Networks

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