Algorithms for Path-Based Placement of Inspection Stations on Networks

References

  • Aho A. V., Hopcroft J. E., Ullman J. D.Design and Analysis of Computer Algorithms (1974) (Addison-Wesley, Reading, MA) Google Scholar
  • Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms and Applications (1993) (Prentice-Hall, Upper Saddle River, NJ) Google Scholar
  • Barber E., Hildebrand L. Guidelines for Applying Criteria to Designate Routes for Transporting Hazardous Materials. (Federal Highway Administration, Washington, DC) . Report No FHWA-IP-80-15Google Scholar
  • Berman O., Krass D., Xu C. W. Locating Discretionary Service Facilities Based on Probabilistic Customer Flows. Transportation Science (1995) 29:276–290LinkGoogle Scholar
  • Cormen T., Leiserson C. E., Rivest R. L.Introduction to Algorithms (1991) (MIT Press, Cambridge, MA) Google Scholar
  • Frederickson G. N., Johnson D. B. The Complexity of Selection and Ranking in X + Y and Matrices with Sorted Columns. Journal of Computer and System Sciences (1982) 24:197–208CrossrefGoogle Scholar
  • Frederickson G. N., Johnson D. B. Generalized Selection and Ranking: Sorted Matrices. SIAM Journal on Computing (1984) 13:14–30CrossrefGoogle Scholar
  • Galil Z., Park K. A Linear Time Algorithm for Concave One-Dimensional Dynamic Programming. Information Processing Letters (1990) 33:309–311CrossrefGoogle Scholar
  • Galil Z., Park K. Dynamic Programming with Convexity, Concavity and Sparsity. Theoretical Computer Science (1992) 92:49–76CrossrefGoogle Scholar
  • Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco) Google Scholar
  • Lawler E. L.Combinatorial Optimization: Networks and Matroids (1976) (Saunders College Publishing, Fort Worth, TX) Google Scholar
  • Mirchandani P. B., Rebello R., Agnetis A. The Inspection Station Location Problem in Hazardous Material Transportation: Some Heuristics and Bounds. Canadian Journal of Operations Research (INFOR) (1995) 33:100–113Google Scholar
  • Mirchandani P. B., Rebello R., Szidarovszky F. Inspection Facilities on a Network: Optimal Locations and Inspection Equilibrium, Presented at ISOLDE'96. (1996) (Edmonton, Canada)Google Scholar
  • Raghavachari M., Tayi G. K. Inspection Configuration and Reprocessing Decisions in Serial Production Systems. International Journal of Production Research (1991) 29:897–911CrossrefGoogle Scholar
  • Rebello R., Agnetis A., Mirchandani P. B. Specialized Inspection Problems in Serial Production Systems. European Journal of Operational Research (1995) 80:227–296CrossrefGoogle Scholar
  • Rosenkrantz D. J., Tayi G. K., Ravi S. S. Optimal Placement of Inspection Stations on Networks. (1998) (University at Albany-State University of New York, Albany, NY) . Technical Report, Department of Computer ScienceGoogle Scholar
  • Tayi G. K., Rosenkrantz D. J., Ravi S. S. Path Problems in Networks with Vector-Valued Edge Weights. Networks (1999) 34:19–35CrossrefGoogle Scholar
  • Viswanadham N., Sharma S. M., Taneja M. Inspection Allocation in Manufacturing Systems Using Stochastic Search Techniques. IEEE Transactions on Systems, Man and Cybernetics. Part A: Systems and Humans (1996) 26:222–230CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.