The K‐partitioning problem: Formulations and branch‐and‐cut - Archive ouverte HAL Access content directly
Journal Articles Networks Year : 2020

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

(1, 2) , (3)
1
2
3
Zacharie Alès
CEDRIC. Optimisation Combinatoire
Optimisation et commande
CV
Arnaud Knippel
Laboratoire de Mathématiques de l'INSA de Rouen Normandie

Domains

Mathematics [math] 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://hal-ensta-paris.archives-ouvertes.fr/hal-03428695

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

Last modification on : Wednesday, September 28, 2022-5:56:01 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 TEI Dublin Core DC Terms EndNote Datacite

Collections

ENSTA INSA-ROUEN CNAM INSMI UMA_ENSTA COMUE-NORMANDIE LMI-ROUEN UNIV-HESAM INSA-GROUPE CEDRIC-CNAM IP_PARIS
40 View
38 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More