ie 631 integer programming fall 2015 1. course objectives modeling techniques (which formulation is...
TRANSCRIPT
IE 631 Integer Programming
Fall 2015
1
Course Objectives
Modeling techniques (Which formulation is good or bad?) Algorithms and theoretical backgrounds Computational Complexity Softwares (Xpress MP, CPLEX)
Integer Programming 2015 2
Integer Programming 2015 3
Instructor Sungsoo Park (room 4112, [email protected], tel:3121)Office hour: Tue., Thr. 16:00 – 17:30 or by appointment
Classroom: E2 room 1120 Class hour: Tue., Thr. 14:30 – 16:00 Homepage: http://solab.kaist.ac.kr TA:
Junghwan Kwak (room 4113, [email protected], tel:3161)Office hour: Mon., Wed. 13:00 – 14:30 or by appointment
Grading: Midterm 30-40%, Final 40-60%, HW 10-20% (including Software)
Text: "Integer and Combinatorial Optimization" by G. Nemhauser and L. Wolsey, 1988, Wiley
Supplementary sources "Optimization over Integers" by D. Bertsimas and R. Weismantel, 2005, Dynamic
Ideas. “Integer Programming” by M. Conforti, G. Cornuejols, and G. Zambelli, 2014,
Springer"Integer Programming" by L. Wolsey, 1998, Wiley "Computers and Intractability: A Guide to the Theory of NP-completeness" by M.
Garey and D. Johnson, 1979, Freeman
Prerequisites: IE 531 Linear Programming required (or consent of instructor)
Integer Programming 2015 4
TopicsIntroductionFormulationsPolyhedral theoryComputational complexityBranch-and-bound algorithmDuality and relaxation, Lagrangian duality, Benders' decompositionStrong valid inequalities, cutting plane algorithmsBranch-and-price algorithm, Branch-and-price-and-cut algorithm(Robust optimization)
Integer Programming 2015 5