Erasmus Research Institute of Management
We present column elimination as a general framework for solving integer programming problems. Problems are represented using an arc flow formulation where solutions are compactly represented as paths in a directed acyclic graph. The column elimination method begins with a relaxed representation, which may include infeasible paths, and solves a constrained network flow over the graph to identify a solution. It then iteratively refines the graph by eliminating infeasible paths until an optimal feasible solution is found.
Room ET-14
Sprekers
- Willem-Jan van Hoeve (Carnegie Mellon University)
Locatie
Burgemeester Oudlaan 50,3062PA Rotterdam