Analysis of Constrained Optimization Variants of the Map-Seeking Circuit Algorithm Page: 1 of 34
This report is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided to UNT Digital Library by the UNT Libraries Government Documents Department.
Extracted Text
The following text was automatically extracted from the image on this page using optical character recognition software:
LA-14302
Approved for public release;
distribution is unlimited.Analysis of Constrained Optimization
Variants of the Map-Seeking Circuit Algorithm
Los Alamos
NATIONAL LABORATORY
EST.1943
Upcoming Pages
Here’s what’s next.
Search Inside
This report can be searched. Note: Results may vary based on the legibility of text within the document.
Tools / Downloads
Get a copy of this page or view the extracted text.
Citing and Sharing
Basic information for referencing this web page. We also provide extended guidance on usage rights, references, copying or embedding.
Reference the current page of this Report.
Harker, S.R.; Vogel, C.R. & Gedeon, T. Analysis of Constrained Optimization Variants of the Map-Seeking Circuit Algorithm, report, September 5, 2005; Los Alamos, New Mexico. (https://digital.library.unt.edu/ark:/67531/metadc873808/m1/1/: accessed April 24, 2024), University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu; crediting UNT Libraries Government Documents Department.