TUM – TUM – Menü

Selected Topics in Discrete Optimization
Seminar


Advisors: Prof. P. Gritzmann, V. Ghiglione
ECTS credits: 3
Time and Room: Thu. 14:15-16:00 in room 02.04.011

News

  • 19th Apr. 2018: The schedule has been changed, see below..
  • 22nd Feb. 2018: The talks have been assigned. Should you have issues with the schedule, please let as know as soon as possible.
  • 8th Feb. 2018: The slides from the presentation meeting can be found here. In case you have not attended the meeting, please confirm your interest by Feb. 16. You may also express your preference concerning the topic you will have assigned.
  • 8th Feb. 2018: Presentation meeting, room 02.06.020 at 13:00.

Topics

Prerequisites

  • Fundamentals of Convex Optimization (MA2504)
  • Discrete Optimization (MA3502)

Talks and Schedule

Date Time Lecturer Topic
19.04.18 14:15 All A 5-minute overview of your topic
26.04.18 14:15 Elena Mille Estimates in Integer Programming
03.05.18 13:00 Thomas Eberhard Total Dual Integrality
17.05.18 14:15 Felix Ackermann Integer Feasibility Problem
24.05.18 14:15 Yuchang Zhang Split Cuts
12.07.18 14:15 Fabian Schaipp Mixed Integer Gomory Cuts
12.07.18 15:35 Ulrich Jakob Oberhofer Lift and Project
14.07.18 10:15 Yangrui Ruan Benders' Decomposition
14.07.18 12:30 Anastasia Litinetskaya Cuts Comparison

You can download the detailed topic description here. Please fix a meeting 2-3 weeks before your talk, to discuss the outline and the media that you will use.

Literature

Books form Springer-Verlag can be downloaded with your TUM credentials at http://link.springer.com/ logging in "via Shibboleth". If you have troubles finding the other material, please contact Viviana Ghiglione.

[1] E. Balas, S. Ceria, and G. Cornuéjols. A lift-and-project cutting plane algorithm for mixed 0–1 programs. Mathematical Programming, 58(1):295–324, Jan 1993.

[2] M. Conforti, G. Cornuéjols, and G. Zambelli. Integer Programming. Graduate Texts in Mathematics. Springer International Publishing, 2014.

[3] M. Jörg. k-disjunctive cuts and cutting plane algorithms for general mixed integer linear programs. PhD Thesis, TUM, 2008.

[4] M. Jünger, T.M. Liebling, D. Naddef, G.L. Nemhauser, W. R. Pulleyblank, G. Reinelt, G. Rinaldi, and L.A. Wolsey. 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art. Springer Berlin Heidelberg, 2009.

[5] H. Marchand, A. Martin, R. Weismantel, and L. Wolsey. Cutting planes in integer and mixed integer programming. Discrete Applied Mathematics, 123(13):397–446, 2002.

[6] R. Rahmaniani, T. G. Crainic, M. Gendreau, and W. Rei. The Benders decomposition algorithm: A literature review. European Journal of Operational Research, 259(3):801–817, 2017.

[7] A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, Inc., New York, NY, USA, 1986.

Research Unit M9


Department of Mathematics
Boltzmannstraße 3
85748 Garching b. München
Germany
phone:+49 89 289-16858
fax:+49 089 289-16859
sekretariat-m9ma.tum.de

Professors

Prof. Dr. Peter Gritzmann
Applied Geometry and Discrete Mathematics

Prof. Dr. Andreas S. Schulz
Mathematics of Operations Research
(affiliated member of M9)

Prof. Dr. Stefan Weltge
Discrete Mathematics

News

April 2018
Case Studies 2018: Save the date: Case Studies poster presentation on May 25th, 2018, final workshop on July 7th, 2018.