Technical Appendix for Polynomial Time Presolve Algorithms for Rotation-Based Models Solving the Robust Stable Matching Problem - Archive ouverte HAL Accéder directement au contenu
Rapport Année : 2024

Technical Appendix for Polynomial Time Presolve Algorithms for Rotation-Based Models Solving the Robust Stable Matching Problem

Résumé

This document is the Technical Appendix for the paper "Polynomial Time Presolve Algorithms for Rotation-Based Models Solving the Robust Stable Matching Problem" accepted at IJCAI-2024. Section 1 contains the complete proof of a lemma from the IJCAI paper. Section 2 describes the constraints used in the constraint programming model used in the paper, and Section 3 presents the full results of the experiments. In Section 4, there is a link to the GitHub repository containing the Java code for the experiments.
Fichier principal
Vignette du fichier
IJCAI_2024__Camera_ready_.pdf (233.74 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04569962 , version 1 (06-05-2024)
hal-04569962 , version 2 (02-09-2024)

Identifiants

  • HAL Id : hal-04569962 , version 2

Citer

Sulian Le Bozec-Chiffoleau, Charles Prud'Homme, Gilles Simonin. Technical Appendix for Polynomial Time Presolve Algorithms for Rotation-Based Models Solving the Robust Stable Matching Problem. IMT Atlantique. 2024. ⟨hal-04569962v2⟩
105 Consultations
45 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More