Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword or section
Like this
1Activity

Table Of Contents

Introduction to Modeling
1.1 Lifeboats and life vests
1.3 The goals of 381
1.4 Exercises
2.1 Graphs and networks
2.2 The traveling salesman problem
2.2.1 Brute force search
2.2.2 Counting the possibilities
2.2.3 Enumerating all possibilities
2.2.4 Branch and bound algorithms
2.3 Complexity theory
2.4 Shortest path problems
2.4.1 Word ladders
2.4.2 Enumerating all paths and a branch and bound algorithm
2.4.3 Dijkstra’s algorithm for shortest paths
2.5 Minimum spanning trees
2.5.1 Kruskal’s algorithm
2.5.2 Prim’s algorithm
2.5.3 Minimum spanning trees and the Euclidean TSP
2.6 Eulerian closed chains
2.7 P, NP, and NP-complete problems
2.8 Exercises
Stochastic Processes
3.1 Basic Statistics
3.2 Probability Distributions and Random Variables
3.2.1 Expected Value
3.3 The Central Limit Theorem
3.4 Buffon’s Needle
3.5 Exercises
Monte Carlo Methods
4.1 A fish tank modeling problem
4.2 Monte Carlo simulation
4.2.1 Comparison of strategies
4.3 A hybrid strategy
4.4 Statistical analysis
4.5 Fish tank simulation code
4.6 Poisson processes
4.7 Queuing theory
4.8 Exercises
5.1 A Markov chain model of a queuing problem
5.2 Review of eigenvalues and eigenvectors
5.4.1 Breakdown of machines
5.4.2 Work schedules
5.4.3 The fish tank inventory problem
5.4.4 Card shuffling
5.5 General properties of transition matrices
5.6 Ecological models and Leslie Matrices
5.6.1 Harvesting strategies
5.7 Exercises
Linear Programming
6.1 Introduction
6.1.1 What is optimization?
6.1.2 An Example
6.1.3 LPs in Standard Form
6.2 A pig farming model
6.2.1 Adding more constraints
6.2.2 Solving the problem by enumeration
6.2.3 Adding a third decision variable
6.2.4 The simplex algorithm
6.3 Complexity and the simplex algorithm
Integer Programming
7.1 The lifeboat problem
7.2 Cargo plane loading
7.3 Branch and bound algorithm
7.4 Traveling salesman problem
7.4.1 NP-completeness of integer programming
7.5 IP in Recreational Mathematics
7.5.1 An Example Puzzle
7.5.2 Formulation of the IP
7.6 Recasting an IP as a 0-1 LP
7.7 Exercises
Evolutionary Trees
8.1 The problem
8.2 Maximum parsimony
8.3 Maximum likelihood
8.4 Searching the forest for the optimal tree
Forest Resource Management
9.1 Timber harvest scheduling
9.2 Spatial structure
9.3 Building roads
9.4 Some other issues
0 of .
Results for:
No results containing your search query
P. 1
!381notes New

!381notes New

Ratings: (0)|Views: 252|Likes:
Published by eroui331

More info:

Published by: eroui331 on Oct 06, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

10/06/2011

pdf

text

original

You're Reading a Free Preview
Pages 4 to 56 are not shown in this preview.
You're Reading a Free Preview
Pages 60 to 62 are not shown in this preview.
You're Reading a Free Preview
Pages 66 to 116 are not shown in this preview.

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->