Subscribe to RSS feed
Demonstrations 21 - 40 of 128
Simple Unconstrained Optimization Method
Comparing Loxodromes and Great Circle Routes
Optimizing the Counterweight Trebuchet
Ant Colony Optimization (ACO)
Minimally Squared Rectangles
Chebyshev Collocation Method for the Helmholtz Problem
Chebyshev Collocation Method for 2D Boundary Value Problems
Polynomial Interpolation Using Equispaced versus Chebyshev-Lobatto Points
The Secretary Problem
Kolmogorov Complexity of 3×3 and 4×4 Squares
The Vehicle Routing Problem
Tin Box with Maximum Volume
The Shortest Distance to a Trefoil Knot
Finding the Global Minimum of a Function Using Simulated Annealing
Maximizing the Volume of a Right Circular Cone with Given Slant Length
The Traveling Salesman Problem 4: Spanning Tree Heuristic
The Traveling Salesman Problem 2: 2-opt Removal of Intersections
The Traveling Salesman Problem 1: Optimal Paths
Fermat Point for Many Points
The Traveling Salesman Problem 3: Nearest Neighbor Heuristic
The #1 tool for creating Demonstrations
and anything technical.
Explore anything with the first
computational knowledge engine.
The web's most extensive
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Join the initiative for modernizing
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
© 2015 Wolfram Demonstrations Project & Contributors |
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have