Return to Index
Operations Research Models and Methods
 
Integer Programming

Resources

 
Integer Programming Models
Textbook

Chapter 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

Applications

Computation Modeling IP's with the Math Programming Add-in
Computation Solving IP's with the LP/IP Solver Add-in
Problems Integer Programming Modeling Problems
Integer Programming Methods

Chapter 8: Integer Programming Models

  • 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
Supplement to Chapter 8: Additional Branch and Bound Algorithms

Teach Integer Programming Add-in

  
Return to Top

Operations Research Models and Methods
Internet
by Paul A. Jensen
Copyright 2004 - All rights reserved