The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
1.4.4 Shortest Path Related Problems ● Connected Components ● Graph Isomorphism ● Matrix Multiplication ● Motion Planning ● Network Flow ● Priority Queues ● Steiner Tree ● Transitive Closure and Reduction Go to the corresponding chapter in the book About the Book Send us Mail Go to Main Page This page last modified on Tue Jun 03, 1997 . file:///E|/WEBSITE/FILES/SHORPATH.HTM (2 of 2) [19/1/2003 1:33:53]
1.2.5 Constrained and Unconstrained Optimization 1.2.5 Constrained and Unconstrained Optimization INPUT OUTPUT Input Description: A function f(x_1,...,x_n) . Problem: What point p = (p_z,...,p_n) maximizes (or equivallently minimizes) the function f ? Implementations ● Netlib / TOMS -- Collected Algorithms of the ACM (FORTRAN) (rating 8) ● Adaptive Simulated Annealing (C) (rating 6) ● Genocop -- Optimization via Genetic Algorithms (C) (rating 5) Related Problems ● Linear Programming file:///E|/WEBSITE/FILES/UNCOTION.HTM (1 of 2) [19/1/2003 1:33:54]
- Page 761 and 762: Index (complete) center vertex, , C
- Page 763 and 764: Index (complete) compaction compari
- Page 765 and 766: Index (complete) counting paths, co
- Page 767 and 768: Index (complete) deletion from bina
- Page 769 and 770: Index (complete) dominance ordering
- Page 771 and 772: Index (complete) English to French
- Page 773 and 774: Index (complete) file directory tre
- Page 775 and 776: Index (complete) geom.bib, geometri
- Page 777 and 778: Index (complete) Hamiltonian Cycle
- Page 779 and 780: Index (complete) implementation cha
- Page 781 and 782: Index (complete) job-shop schedulin
- Page 783 and 784: Index (complete) linear programming
- Page 785 and 786: Index (complete) , , , , , , , math
- Page 787 and 788: Index (complete) modular arithmetic
- Page 789 and 790: Index (complete) normal distributio
- Page 791 and 792: Index (complete) parallel algorithm
- Page 793 and 794: Index (complete) planar subdivision
- Page 795 and 796: Index (complete) proof of correctne
- Page 797 and 798: Index (complete) regular expression
- Page 799 and 800: Index (complete) self-organizing tr
- Page 801 and 802: Index (complete) sine functions sin
- Page 803 and 804: Index (complete) spring embedding h
- Page 805 and 806: Index (complete) Symbol Technologie
- Page 807 and 808: Index (complete) trial division Tri
- Page 809 and 810: Index (complete) VLSI circuit layou
- Page 811: 1.4.4 Shortest Path 1.4.4 Shortest
- Page 815 and 816: 1.6.4 Voronoi Diagrams 1.6.4 Vorono
- Page 817 and 818: 1.4.7 Eulerian Cycle / Chinese Post
- Page 819 and 820: Online Bibliographies Online Biblio
- Page 821 and 822: About the Book -- The Algorithm Des
- Page 823 and 824: Copyright and Disclaimers Copyright
- Page 825 and 826: CD-ROM Installation Installation an
- Page 827 and 828: CD-ROM Installation install a sound
- Page 829 and 830: Thanks! Frank Ruscica file:///E|/WE
- Page 831 and 832: Thanks! Zhong Li Thanks also to Fil
- Page 833 and 834: CD-ROM Installation To use the CD-R
- Page 835 and 836: Binary Search in Action Binary Sear
- Page 837 and 838: Binary Search in Action file:///E|/
- Page 839 and 840: Binary Search in Action file:///E|/
- Page 841 and 842: Postscript version of the lecture n
- Page 843 and 844: Lecture 1 - analyzing algorithms Ne
- Page 845 and 846: Lecture 1 - analyzing algorithms Yo
- Page 847 and 848: Lecture 1 - analyzing algorithms Th
- Page 849 and 850: Lecture 1 - analyzing algorithms Th
- Page 851 and 852: Lecture 1 - analyzing algorithms is
- Page 853 and 854: Lecture 2 - asymptotic notation How
- Page 855 and 856: Lecture 2 - asymptotic notation Not
- Page 857 and 858: Lecture 2 - asymptotic notation alg
- Page 859 and 860: Lecture 2 - asymptotic notation Sup
- Page 861 and 862: Lecture 2 - asymptotic notation Nex
1.2.5 Constrained and Unconstrained Optimization<br />
1.2.5 Constrained and Unconstrained Optimization<br />
INPUT OUTPUT<br />
Input Description: A function f(x_1,...,x_n) .<br />
Problem: What point p = (p_z,...,p_n) maximizes (or equivallently minimizes) the function f ?<br />
Implementations<br />
● Netlib / TOMS -- Collected <strong>Algorithm</strong>s of the ACM (FORTRAN) (rating 8)<br />
● Adaptive Simulated Annealing (C) (rating 6)<br />
● Genocop -- Optimization via Genetic <strong>Algorithm</strong>s (C) (rating 5)<br />
Related Problems<br />
● Linear Programming<br />
file:///E|/WEBSITE/FILES/UNCOTION.HTM (1 of 2) [19/1/2003 1:33:54]
Change language