Useful Links
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
  1. 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
  1. Integer Programming
    1. Introduction to Integer Programming
      1. Differences from Linear Programming
        1. Complexity Considerations
          1. Applications of Integer Programming
          2. Types of Integer Programming Models
            1. Pure Integer Programming
              1. Mixed-Integer Programming
                1. Binary Integer Programming
                  1. Special Structures
                  2. Model Formulation Techniques
                    1. Binary Variable Applications
                      1. Logical Constraints
                        1. Fixed Charge Problems
                          1. Set Covering Problems
                            1. Set Partitioning Problems
                              1. Knapsack Problems
                              2. Solution Methods for Integer Programming
                                1. Branch and Bound Method
                                  1. Tree Structure and Branching
                                    1. Node Selection Strategies
                                      1. Bounding Techniques
                                        1. Pruning Rules
                                        2. Cutting Plane Methods
                                          1. Gomory Cuts
                                            1. Valid Inequalities
                                              1. Facet-Defining Inequalities
                                              2. Heuristic Methods
                                                1. Rounding Heuristics
                                                  1. Greedy Algorithms
                                                    1. Local Search Methods
                                                  2. Special Integer Programming Problems
                                                    1. Traveling Salesman Problem
                                                      1. Vehicle Routing Problem
                                                        1. Facility Location Problems
                                                          1. Scheduling Problems

                                                        Previous

                                                        5. Network Optimization Models

                                                        Go to top

                                                        Next

                                                        7. Nonlinear Programming

                                                        © 2025 Useful Links. All rights reserved.

                                                        About•Bluesky•X.com