Integer Programming
INDE 7340
Credit Hours: 3.0
Lecture Contact Hours: 3 Lab Contact Hours: 0
Prerequisite: Graduate standing and/or consent of instructor
Formulation of integer programming problems; optimality conditions; relaxation techniques; bounds; complexity, branch-and-bound, cutting planes, valid inequalities, column generations; Bender’s decomposition; heuristic methods.
Lecture Contact Hours: 3 Lab Contact Hours: 0
Prerequisite: Graduate standing and/or consent of instructor
Formulation of integer programming problems; optimality conditions; relaxation techniques; bounds; complexity, branch-and-bound, cutting planes, valid inequalities, column generations; Bender’s decomposition; heuristic methods.
Sources:
Basic Information
- Earliest record:
- Latest record:
- Number of instructors:
- Number of sections:
- Average number of students per section: