Efficient algorithms and codes for K-cardinality assignment problems

M. Dell'Amico, Andrea Lodi and S. Martello

Article (2001)

Document published while its authors were not affiliated with Polytechnique Montréal

An external link is available for this item

PolyPublie URL:	https://publications.polymtl.ca/27466/
Journal Title:	Discrete Applied Mathematics (vol. 110, no. 1)
Publisher:	Elsevier
DOI:	10.1016/s0166-218x(00)00301-2
Official URL:	https://doi.org/10.1016/s0166-218x%2800%2900301-2
Date Deposited:	18 Apr 2023 15:21
Last Modified:	05 May 2023 15:33

Cite in APA 7:	Dell'Amico, M., Lodi, A., & Martello, S. (2001). Efficient algorithms and codes for K-cardinality assignment problems. Discrete Applied Mathematics, 110(1), 25-40. https://doi.org/10.1016/s0166-218x%2800%2900301-2
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)Répertoire des publications (EndNote)Simple Metadata

Statistics

Repository Staff Only