Maxence Delorme

Mathematical models for stable matching problems with ties and incomplete lists

  • Maxence Delorme
  • Jacek Gondzio
  • William Pettersson
  • Sergio García
  • Joerg Kalcsics
  • David Manlove
    • Categories Combinatorial Optimization, Integer Programming Tags , , , ,

    We present new integer linear programming (ILP) models for NP-hard optimisation problems in instances of the Stable Marriage problem with Ties and Incomplete lists (SMTI) and its many-to-one generalisation, the Hospitals / Residents problem with Ties (HRT). These models can be used to efficiently solve these optimisation problems when applied to (i) instances derived from … Read more

    Enhanced Pseudo-Polynomial Formulations for Bin Packing and Cutting Stock Problems

  • Maxence Delorme
  • Manuel Iori
    • Categories (Mixed) Integer Linear Programming Tags , , , , ,

    We study pseudo-polynomial formulations for the classical bin packing and cutting stock problems. We first propose an overview of dominance and equivalence relations among the main pattern-based and pseudo-polynomial formulations from the literature. We then introduce reflect, a new formulation that uses just half of the bin capacity to model an instance and needs significantly … Read more