TY - INPR A1 - Bärmann, Andreas A1 - Gellermann, Thorsten A1 - Merkert, Maximilian A1 - Schneider, Oskar T1 - Staircase Compatibility and its Applications in Scheduling and Piecewise Linearization N2 - We consider the clique problem with multiple-choice constraints (CPMC) and characterize a case where it is possible to give an efficient description of the convex hull of its feasible solutions. This case, which we call staircase compatibility, generalizes common properties in applications and allows for a linear description of the integer feasible solutions to (CPMC) with a totally unimodular constraint matrix of polynomial size. We derive two such totally unimodular reformulations for the problem: one that is obtained by a strengthening of the compatibility constraints and one that is based on a representation as a dual network flow problem. Furthermore, we show a natural way to derive integral solutions from fractional solutions to the problem by determining integral extreme points generating this fractional solution. We also evaluate our reformulations from a computational point of view by applying them to two different real-world applications. The first one is a problem in railway timetabling where we try to adapt a given timetable slightly such that energy costs from operating the trains are reduced. The second one is the piecewise linearization of non-linear flow problems on a gas network. In both cases, we are able to reduce the solution times significantly by passing to the theoretically stronger formulations of the problem. KW - Clique Problem KW - Multiple-Choice Constraints KW - Total Unimodularity KW - Scheduling KW - Piecewise Linearization Y1 - 2016 ER -