Operations Research
Differences from Linear Programming
Complexity Considerations
Applications of Integer Programming
Pure Integer Programming
Mixed-Integer Programming
Binary Integer Programming
Special Structures
Binary Variable Applications
Logical Constraints
Fixed Charge Problems
Set Covering Problems
Set Partitioning Problems
Knapsack Problems
Tree Structure and Branching
Node Selection Strategies
Bounding Techniques
Pruning Rules
Gomory Cuts
Valid Inequalities
Facet-Defining Inequalities
Rounding Heuristics
Greedy Algorithms
Local Search Methods
Traveling Salesman Problem
Vehicle Routing Problem
Facility Location Problems
Scheduling Problems
Previous
5. Network Optimization Models
Go to top
Next
7. Nonlinear Programming