An iterated-tabu-search heuristic for a variant of the partial set covering problem

Nehme Bilal, Philippe Galinier and François Guibault

Article (2014)

An external link is available for this item

Department:	Department of Computer Engineering and Software Engineering
PolyPublie URL:	https://publications.polymtl.ca/12698/
Journal Title:	Journal of Heuristics (vol. 20, no. 2)
Publisher:	Springer
DOI:	10.1007/s10732-013-9235-9
Official URL:	https://doi.org/10.1007/s10732-013-9235-9
Date Deposited:	18 Apr 2023 15:07
Last Modified:	08 Apr 2025 01:39

Cite in APA 7:	Bilal, N., Galinier, P., & Guibault, F. (2014). An iterated-tabu-search heuristic for a variant of the partial set covering problem. Journal of Heuristics, 20(2), 143-164. https://doi.org/10.1007/s10732-013-9235-9
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