Generalized Relax-and-Fix heuristic - Laboratoire de Mathématiques Appliquées du Havre Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Generalized Relax-and-Fix heuristic

Résumé

This paper introduces a heuristic for mixed-integer mathematical programs, that can be seen as a generalization of the relax-and-fix heuristic: a sequence of derived subproblems is solved, progressively fixing variables in the original problem. We propose a generic implementation and report on numerical results for four well-known operational research applications: lot-sizing, vehicle routing, bin-packing and portfolio optimization. Results show that this heuristic may be competitive depending on the definition of subproblems.
Fichier principal
Vignette du fichier
2022ISCO_RestrictFix_heuristic.pdf (198.26 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04302971 , version 1 (23-11-2023)

Identifiants

  • HAL Id : hal-04302971 , version 1

Citer

S. Michel, Cédric Joncour, Xavier Schepler, Julien Kritter. Generalized Relax-and-Fix heuristic. International Symposium on Combinatorial Optimization, May 2022, Online conference, France. ⟨hal-04302971⟩
9 Consultations
10 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More