|
7 Integer Programming Models
- 7.1 Site Selection Example
- 7.2 General Considerations
- 7.3 System Design with Fixed Charges
- 7.4 Facility Location Problem
- 7.5 Covering and Partitioning Problems
- 7.6 Distance Problems
- 7.7 Examples
- 7.8 Nonlinear Objective Function
- 7.9 Exercises
- Bibliography
|
|
Models
Integer
Programming Models
|
|
Problems
Integer
Programming Modeling Problems |
|
Computation
Math
Programming Add-in
Add-in to construct IP and MIP models
|
|
8 Integer Programming Methods
- 8.1 Greedy Algorithms
- 8.2 Solution by Enumeration
- 8.3 Branch and Bound
- 8.4 Cutting Plane Methods
- 8.5 Additional Cuts
- 8.6 Exercises
- Bibliography
|
|
Supplements
to Ch. 8
Integer
Programming Methods
- Additional Branch and Bound Algorithms
|
|
Methods
Integer
Programming
|
|
Computation
LP/IP
Solver Add-in
Add-in to solve IP and MIP models
|
|
Computation
Optimize
Add-in
Add-in to model and solve combinatorial problems
including Traveling Salesman, Permutation, and Tree
Problems
|
|
Computation
Combinatorics
Add-in
Add-in to model combinatorial problems including
the Quadratic Assignment Problem
|
|
|