Computational study of a branching algorithm for the maximum k-cut problem

Vilmar Rodrigues de Sousa, Miguel F. Anjos and Sébastien Le Digabel

Article (2021)

An external link is available for this item

Department:	Department of Mathematics and Industrial Engineering
Research Center:	GERAD - Research Group in Decision Analysis
PolyPublie URL:	https://publications.polymtl.ca/48691/
Journal Title:	Discrete Optimization
Publisher:	Elsevier
DOI:	10.1016/j.disopt.2021.100656
Official URL:	https://doi.org/10.1016/j.disopt.2021.100656
Date Deposited:	18 Apr 2023 15:00
Last Modified:	28 Mar 2025 16:40

Cite in APA 7:	Rodrigues de Sousa, V., Anjos, M. F., & Le Digabel, S. (2021). Computational study of a branching algorithm for the maximum k-cut problem. Discrete Optimization, 100656 (20 pages). https://doi.org/10.1016/j.disopt.2021.100656
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Repository Staff Only