Survey of Deterministic Networks
Bradley, Gordon H.
MetadataShow full item record
The state-of-the-art of deterministic networks is surveyed with a discussion of shortest path, transportation, assignment, transshipment, maximum flow, minimum spanning tree, Chinese postman, Euler path and multicommodity flow models. The computational complexity of network models is discussed. The survey concentrates on models and algorithms that can be used to solve large-scale problems.
The article of record as published may be found at https://doi.org/10.1080/05695557508975429
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Buss, Arnold (Monterey, California: Naval Postgraduate School., 2004);A recurring dilemma in the use of simulation models for analytic support of decision-making has been the length of time required to build the simulation model. Although emerging simulations have improved over legacy models, ...
Taylor, Ian (Monterey, California: Naval Postgraduate School, 2017-09);This research presents the first accurate three and six Degree of Freedom (DOF) models of the small diameter REMUS 100 with cross-tunnel thrusters (CTT). These are the first known hydrodynamic models to explicitly consider ...
Chatzigeorgiadis, Filippos (Monterey California. Naval Postgraduate School, 2006-09);The significance of the Radar Cross Section (RCS) in the outcome of military engagements makes its prediction an important problem in modern Electronic Warfare. The POFACETS program, previously developed at the Naval ...