Completed
Operations Research 09G: Traveling Salesman Problem - Nearest Neighbor Method
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Operations Research
Automatically move to the next video in the Classroom when playback concludes
- 1 Operations Research 01: Operations Research Course Overview
- 2 Operations Research 02: Introduction to Operations Research
- 3 Operations Research 03A: Linear Function & Linear Inequality
- 4 Operations Research 03B: Typical Linear Programming Problems
- 5 Operations Research 03C: Linear Programming Feasible Region
- 6 Operations Research 03D: Linear Programming Graphical Solution Technique
- 7 Operations Research 03E: Binding & Nonbinding Constraints
- 8 Operations Research 03F: Convex Set & Convex Function
- 9 Operations Research 03G: Linear Programming Extreme Points
- 10 Operations Research 03H: Linear Programming Staff Scheduling Problem
- 11 Operations Research 03I: Linear Programming Blending Problem
- 12 Operations Research 03J: Linear Programming Production Process Problem
- 13 Operations Research 03K: Linear Programming Multiperiod Inventory Problem
- 14 Operations Research 04A: Linear Programming Slack & Excess Variables
- 15 Operations Research 04B: Simplex Method Basic Feasible Solution
- 16 Operations Research 04C: Simplex Method Graphical Explanation
- 17 Operations Research 04D: Simplex Method Entering & Leaving Variables, Pivoting
- 18 Operations Research 04E: Simplex Method & The Big M
- 19 Operations Research 04F: Simplex Method Unrestricted-in-Sign Variables
- 20 Operations Research 04G: Goal Programming
- 21 Operations Research 04H: Different Cases of Simplex Solutions
- 22 Operations Research 05A: Sensitivity Analysis & Shadow Price
- 23 Operations Research 05B: Primal & Dual Problems
- 24 Operations Research 05C: Weak Duality & Strong Duality
- 25 Operations Research 05D: Complementary Slackness
- 26 Operations Research 05E: Dual Simplex Method
- 27 Operations Research 06A: Transportation Problem
- 28 Operations Research 06B: Transportation Northwest Corner Method
- 29 Operations Research 06C: Transportation Minimum Cost Method
- 30 Operations Research 06D: Transportation Vogel's Method
- 31 Operations Research 07A: Transportation Loop & Pivoting
- 32 Operations Research 07B: Transportation Simplex Method
- 33 Operations Research 07C: Transshipment Problem
- 34 Operations Research 07D: Assignment Problem & Hungarian Method
- 35 Operations Research 08A: Directed & Undirected Networks
- 36 Operations Research 08B: Shortest Path & Dijkstra’s Algorithm - Undirected Networks
- 37 Operations Research 08C: Shortest Path & Dijkstra’s Algorithm - Directed Networks
- 38 Operations Research 08D: Converting Shortest Path Problem to Transshipment Problem
- 39 Operations Research 08E: Minimum Spanning Tree
- 40 Operations Research 08F: Maximum Flow Problem Formulation
- 41 Operations Research 08G: Maximum Flow Problem & Ford Fulkerson Method
- 42 Operations Research 08H: Project Network
- 43 Operations Research 08I: Early/late Event Time, Total Float, Critical Path
- 44 Operations Research 08J: Program Evaluation & Review Technique PERT
- 45 Operations Research 09A: Integer Programming vs Linear Programming Relaxation
- 46 Operations Research 09B: Branch and Bound for Integer Programming
- 47 Operations Research 09C: Knapsack Problem
- 48 Operations Research 09D: Job Shop Scheduling Problem
- 49 Operations Research 09E: Traveling Salesman Problem - Integer Programming
- 50 Operations Research 09F: Traveling Salesman Problem - Hungarian Method
- 51 Operations Research 09G: Traveling Salesman Problem - Nearest Neighbor Method
- 52 Operations Research 10A: Derivatives of Basic, Trigonometric, Composite Functions
- 53 Operations Research 10B: Hessian Matrix, Convex & Concave Functions
- 54 Operations Research 10C: Nonlinear Convex Programming & KKT Conditions
- 55 Operations Research 11: Decision Trees & Decision Making under Uncertainty
- 56 Operations Research 12A: Zero-Sum Game & Pure Strategy
- 57 Operations Research 12B: Rock, Paper, Scissors Game & Mixed Strategy
- 58 Operations Research 12C: Nonconstant-Sum Game & Prisoner's Dilemma
- 59 Operations Research 12D: More about Nash Equilibrium
- 60 Operations Research 13A: Stochastic Process & Markov Chain
- 61 Operations Research 13B: Markov Chain n-Step Transition
- 62 Operations Research 13C: Ergodic Markov Chain
- 63 Operations Research 13D: Markov Chain Steady-State Theorem
- 64 Operations Research 13E: Markov Chain Mean First Passage Time
- 65 Operations Research 13F: Absorbing Markov Chain
- 66 Operations Research 14A: Economic Order Quantity (EOQ) Model with Zero Lead Time
- 67 Operations Research 14B: Economic Order Quantity (EOQ) Model with Nonzero Lead Time
- 68 Operations Research 14C: Economic Production Quantity (EPQ) Model
- 69 Operations Research 14D: Newsvendor Inventory Model
- 70 Operations Research 14E: Capacity-Controlled Fare (Early Bird Discount)
- 71 Operations Research 14F: Revenue Management & Airline Overbooking
- 72 Operations Research 15A: AMPL - Download & Installation
- 73 Operations Research 15B: AMPL - Quick Start Guide for Linear Programming
- 74 Operations Research 15C: AMPL - Model and Data Separation
- 75 Operations Research 15D: AMPL - Integer & Mixed Integer Programming
- 76 Operations Research 15E: AMPL - Nonlinear Programming
- 77 Operations Research 15F: AMPL - NEOS Server
