The K‐partitioning problem: Formulations and branch‐and‐cut - ENSTA Paris - École nationale supérieure de techniques avancées Paris
Journal Articles Networks Year : 2020

The K‐partitioning problem: Formulations and branch‐and‐cut

Zacharie Alès
CEDRIC. Optimisation Combinatoire
Optimisation et commande
CV
Arnaud Knippel
Laboratoire de Mathématiques de l'INSA de Rouen Normandie

Domains

Combinatorics [math.CO]
Fichier principal
Vignette du fichier
2020-03-31_ALES_KNIPPEL_Networks_v2.pdf (423.86 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Zacharie Ales  : Connect in order to contact the contributor

https://ensta-paris.hal.science/hal-03428695

Submitted on : Tuesday, December 28, 2021-9:38:45 AM

Last modification on : Tuesday, August 6, 2024-10:56:04 AM

Long-term archiving on : Tuesday, March 29, 2022-6:07:45 PM

Download

Dates and versions

hal-03428695 , version 1 (28-12-2021)

Identifiers

Cite

Zacharie Alès, Arnaud Knippel. The K‐partitioning problem: Formulations and branch‐and‐cut. Networks, 2020, 76 (3), pp.323-349. ⟨10.1002/net.21944⟩. ⟨hal-03428695⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

ENSTA INSA-ROUEN CNAM UMA_ENSTA COMUE-NORMANDIE LMI-ROUEN INSA-GROUPE CEDRIC-CNAM IP_PARIS HESAM
131 View
772 Download

Altmetric

Share

More