Optimal configuration of a command and control network

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Optimal configuration of a command and control network: balancing performance and reconfiguration constraints

Full text

Pdf (405 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 2000 ACM symposium on Applied computing - Volume 1 table of contents

Como, Italy

Pages: 94 - 98

Year of Publication: 2000

ISBN:1-58113-240-9

Author

L. Jonathan Dowell

Los Alamos National Laboratory, P.O. Box 1663 MS F604, Los Alamos, NM

Sponsor

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 12, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/335603.335708 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	E.W. Dijkstra, A Note on Two Problems in Connexion with Graphs, Numerische Mathematik I (1959) 269-271.
	2	E. Minieka, Optimization algorithms for networks and graphs. M. Dekker, New York, 1978.
	3	G.Y. Handler, Minimax Location of a Facility in an Undirected Tree Graph, Transportation Science 7 (1973) 287-293.
	4	Bryant A. Julstrom, Coding TSP tours as permutations via an insertion heuristic, Proceedings of the 1999 ACM symposium on Applied computing, p.297-301, February 28-March 02, 1999, San Antonio, Texas, United States [doi>10.1145/298151.298356]
	5	Kengo Katayama , Hiroyuki Narihisa, A new iterated local search algorithm using genetic crossover for the traveling salesman problem, Proceedings of the 1999 ACM symposium on Applied computing, p.302-306, February 28-March 02, 1999, San Antonio, Texas, United States [doi>10.1145/298151.298359]
	6	B.C. Tanset, R. L. Francis, and T. J. Lowe, Location on Networks: A Survey. Part I. The p-Center and p-Median Problems, Management Science 29 (1983) 482--497.
	7	B.C. Tansel, R. L. Francis, and T. I. Lowe, Location on Networks: A Survey. Part II. Exploiting Tree Network Structure, Management Science 29 (1983)498--511.
	8	David A. van Veldhuizen , Gary B. Lamont, Multiobjective evolutionary algorithm test suites, Proceedings of the 1999 ACM symposium on Applied computing, p.351-357, February 28-March 02, 1999, San Antonio, Texas, United States [doi>10.1145/298151.298382]
	9	D. Whitley, T. Starkweather, and D. Shaner, The Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination. In L. Davis, ed., Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York, 1991.