J
Jared L. Cohon
Researcher at Johns Hopkins University
Publications - 43
Citations - 3069
Jared L. Cohon is an academic researcher from Johns Hopkins University. The author has contributed to research in topics: Facility location problem & Shortest path problem. The author has an hindex of 25, co-authored 42 publications receiving 2949 citations.
Papers
More filters
Journal ArticleDOI
A review and evaluation of multiobjective programing techniques
Jared L. Cohon,David H. Marks +1 more
TL;DR: In this article, three criteria are established for the evaluation of the utility of multiobjective programing techniques for water resource planning: computational efficiency, explicitness of trade offs among objectives, and the amount of information generated for decision making.
Journal ArticleDOI
A Programming Model for Analysis of the Reliability, Resilience, and Vulnerability of a Water Supply Reservoir
TL;DR: In this article, the tradeoffs between reliability, vulnerability, and resilience were examined using multiobjective mixed-integer, linear programming, and it was found that as reliability is increased or as the maximum length of consecutive shortfalls decreases (resilience increases), the vulnerability of the water system to larger deficits increases.
Journal ArticleDOI
Simultaneous siting and routing in the disposal of hazardous wastes
TL;DR: Methods of shortest paths, a zero-one mathematical program for siting, and the weighting method of multiobjective programming are blended to show how to derive optimal solutions to the development of a model which simultaneously sites the storage facilities, assigns reactors to those facilities and chooses routes for the shipment of the spent fuel.
Journal ArticleDOI
The Team/Fleet Models for Simultaneous Facility and Equipment Siting
TL;DR: In this paper, a number of new location models which utilize the notion of coverage were developed, tested and utilized in a study of the Baltimore City Fire Protection System (BCFDPS).
Journal ArticleDOI
The maximum covering/shortest path problem: A multiobjective network design and routing formulation
TL;DR: In this article, the authors introduce the maximum covering/shortest path problem and the maximum population shortest path problem, a special case of the former model, and formulate them as two objective integer programs.