Hausdorff School on Computational Combinatorial Optimization
September 12-16, 2022
Research Institute for Discrete Mathematicsm Bonn
>
Speakers:
Armin Biere, Robert E. Bixby, Petra Mutzel, Eduardo Uchoa.Organizers:
William Cook, Stephan HeldLecture Slides:
Monday:
- Eduardo Uchoa: Introduction to Column Generation
- Petra Mutzel: Introduction, ILP Formulations for the Graph Coloring Problem
- Robert E Bixby: Linear Programming - A Historical View
Tuesday:
- Petra Mutzel: Graph Similarity - Introduction, Structural Approaches
- Eduardo Uchoa: Advances in Exact Algorithms for Vehicle Routing
- Exercise Class: Vehicle Routing Exercise, VRPSolver home page, You also need IBM ILOG CPLEX (offering free academic licenses) to run VRPSolver, VLSI instances arising in scan chain optimization.
Wednesday:
- Exercise Class: Coloring exercise description and Python files, DIMACS benchmarks , The original source codes of POP, POP2, ASS+c, ASS+e, REP and AREP by Petra Mutzel and Adalat Jabrayilov, Gurobi (offering free academic licenses), Exactcolors (open source) column generation (requires CPLEX, Gurobi or QSOPT as an LP solver).
Thursday
- Armin Biere: SAT Solving
- Exercise Class: SAT Coloring Exercise, Kissat and other SAT solvers by Armin Biere.
Friday
- Armin Biere: SAT Solving
- Petra Mutzel: Graph Similarity - Graph Embedding