Fair integer programming under dichotomous and cardinal preferences

Tom Demeulemeester, Dries R. Goossens, Ben Hermans, Roel Leus

Abstract: Highlights•We study how to fairly select one of the optimal solutions of integer programs.•Our methods apply to integer programs with binary, integer, or real decision variables.•Computational performance is evaluated for kidney exchange and machine scheduling.•One of our mechanisms uses similar run times as finding one optimal solution.