Andere Kunden interessierten sich auch für
![Combinatorial Optimization]( "Combinatorial Optimization")
Combinatorial Optimization67,99 €![Conjugate Gradient Algorithms in Nonconvex Optimization]( "Conjugate Gradient Algorithms in Nonconvex Optimization")
Conjugate Gradient Algorithms in Nonconvex Optimization110,99 €![Optimized Packings with Applications]( "Optimized Packings with Applications")
Optimized Packings with Applications37,99 €![Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice]( "Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice")
Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice74,99 €![Fault-Tolerant Search Algorithms]( "Fault-Tolerant Search Algorithms")
Fault-Tolerant Search Algorithms37,99 €![Genetic Algorithms: Principles and Perspectives]( "Genetic Algorithms: Principles and Perspectives")
Genetic Algorithms: Principles and Perspectives110,99 €![Algorithms and Programming]( "Algorithms and Programming")
Algorithms and Programming35,99 €
1. The Linear Sum Assignment Problem.- 2. The Linear Bottleneck Assignment Problem.- 3. The Cardinality Matching Problem.- 4. The Sum Matching Problem.- 5. The Bottleneck Matching Problem.- 6. The Chinese Postman Problem.- 7. Quadratic Assignment Problems.- 8. QAP Heuristic 1: The method of increasing degree of freedom.- 9. QAP Heuristic 2: Cutting plane and exchange method.- 10. General Subroutines.