Using local search to speed up filtering algorithms for some NP-hard constraints

Philippe Galinier, Alain Hertz, Sandrine Paroz and Gilles Pesant

Article (2011)

An external link is available for this item

Additional Information:	5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), Paris, France
Department:	Department of Computer Engineering and Software Engineering
Research Center:	GERAD - Research Group in Decision Analysis
PolyPublie URL:	https://publications.polymtl.ca/16874/
Journal Title:	Annals of Operations Research (vol. 184, no. 1)
Publisher:	Springer
DOI:	10.1007/s10479-010-0715-0
Official URL:	https://doi.org/10.1007/s10479-010-0715-0
Date Deposited:	18 Apr 2023 15:12
Last Modified:	14 May 2025 14:11

Cite in APA 7:	Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (2011). Using local search to speed up filtering algorithms for some NP-hard constraints. Annals of Operations Research, 184(1), 121-135. https://doi.org/10.1007/s10479-010-0715-0
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