An optimal strategy for the constrained cycle cover problem

Gilles Pesant and P. Soriano

Article (2002)

An external link is available for this item

Additional Information:	Nom historique du département: Département de génie informatique
Department:	Department of Computer Engineering and Software Engineering
PolyPublie URL:	https://publications.polymtl.ca/26373/
Journal Title:	Annals of Mathematics and Artificial Intelligence (vol. 34, no. 4)
Publisher:	Kluwer Academic Publishers
DOI:	10.1023/a:1014444525059
Official URL:	https://doi.org/10.1023/a%3a1014444525059
Date Deposited:	18 Apr 2023 15:20
Last Modified:	08 Apr 2025 02:15

Cite in APA 7:	Pesant, G., & Soriano, P. (2002). An optimal strategy for the constrained cycle cover problem. Annals of Mathematics and Artificial Intelligence, 34(4), 313-325. https://doi.org/10.1023/a%3a1014444525059
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