Useful Links
Systems Science
Operations Research
1. Introduction to Operations Research
2. Mathematical Preliminaries
3. Linear Programming
4. Transportation and Assignment Problems
5. Network Optimization Models
6. Integer Programming
7. Nonlinear Programming
8. Dynamic Programming
9. Stochastic Processes and Markov Chains
10. Queueing Theory
11. Inventory Theory
12. Simulation
13. Decision Analysis
14. Heuristics and Metaheuristics
Integer Programming
Introduction to Integer Programming
Differences from Linear Programming
Complexity Considerations
Applications of Integer Programming
Types of Integer Programming Models
Pure Integer Programming
Mixed-Integer Programming
Binary Integer Programming
Special Structures
Model Formulation Techniques
Binary Variable Applications
Logical Constraints
Fixed Charge Problems
Set Covering Problems
Set Partitioning Problems
Knapsack Problems
Solution Methods for Integer Programming
Branch and Bound Method
Tree Structure and Branching
Node Selection Strategies
Bounding Techniques
Pruning Rules
Cutting Plane Methods
Gomory Cuts
Valid Inequalities
Facet-Defining Inequalities
Heuristic Methods
Rounding Heuristics
Greedy Algorithms
Local Search Methods
Special Integer Programming Problems
Traveling Salesman Problem
Vehicle Routing Problem
Facility Location Problems
Scheduling Problems
Previous
5. Network Optimization Models
Go to top
Next
7. Nonlinear Programming