at the RWTH Aachen University, Germany; interested in discrete optimization, integer programming (in particular the computational aspects of it), algorithm engineering, approximation algorithms, machine learning, etc. My favorite toy is Dantzig-Wolfe reformulation (and other decomposition techniques); we work on a generic decomposition solver (Dantzig-Wolfe, Benders, Lagrange), it is called GCG and it is part of the SCIP Optimization Suite.
Top network posts
- 23 What are the tradeoffs between "exact" and Reinforcement Learning methods for solving optimization problems
- 21 How to (graphically) present computational results?
- 20 "Best practices" for formulating MIPs
- 20 Dual bounds of integer programming problems
- 19 How to choose between high number of binary variables or fewer number of integer (not only 0 and 1) variables in a IP formulation?
- 17 Can presolve reductions change the value of the linear programming relaxation?
- 16 How to evaluate the performance of open source solver?
- View more network posts →