Decision-Making
- Introduction
- Decision Problems in Logistics
- Logistics Optimization Problems
- Mathematical Optimization
- Example: Single Machine Scheduling
- Example: TSP
- Network Models
- Example: Interval Scheduling
- Graphs
- Trees
- Formulation of the Network Flow Problem
- Formulation
- Variants
- Matrix Representation
- Circulation
- Algorithm & Complexity
- algorithms
- counting the number of arithmetic operations
- rate of growth
- worst-case analysis
- polynomial-time algorithm
- Minimum Spanning Tree Problem
- Tree & Spanning Tree
- MST Problem
- Greedy Algorithm
- Greedy Algorithm for MST
- Shortest Path Problem
- Problem definition
- Relation to the network flow problem
- Bellman’s equation
... read more
- Introduction
- Decision Problems in Logistics
- Logistics Optimization Problems
- Mathematical Optimization
- Example: Single Machine Scheduling
- Example: TSP
- Network Models
- Example: Interval Scheduling
- Graphs
- Trees
- Formulation of the Network Flow Problem
- Formulation
- Variants
- Matrix Representation
- Circulation
- Algorithm & Complexity
- algorithms
- counting the number of arithmetic operations
- rate of growth
- worst-case analysis
- polynomial-time algorithm
- Minimum Spanning Tree Problem
- Tree & Spanning Tree
- MST Problem
- Greedy Algorithm
- Greedy Algorithm for MST
- Shortest Path Problem
- Problem definition
- Relation to the network flow problem
- Bellman’s equation
- Bellman-Ford algorithm
- Label correcting methods
- Dijkstra’s algorithm
- Negative Cost Cycle Algorithm for Min-Cost
- Maximum Flow Problem
- Augmenting path
- The Ford-Fulkerson algorithm
- Labeling algorithm
- Cut
- Linear Programming
- definition of LP
- Example: Product-Mix Problem
- using Excel Solver
- Example: Advertisig-Mix Problem
- Linear Programing: Formulation and Applications
- LP Model
- Adertising-Mix Problem
- Resource_Allocation Problem
- Cost-Benefit Tradeoff Problem
- Transportation Problem
- Assignment Problem
-->
Comments