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

Philippe Galinier, Alain Hertz, Sandrine Paroz and Gilles Pesant

Paper (2008)

An external link is available for this item

Department:	Department of Computer Engineering and Software Engineering Department of Mathematics and Industrial Engineering
Research Center:	GERAD - Research Group in Decision Analysis
ISBN:	9783540681557
PolyPublie URL:	https://publications.polymtl.ca/20788/
Conference Title:	5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008)
Conference Location:	Paris, France
Conference Date(s):	2008-05-20 - 2008-05-23
Publisher:	Springer
DOI:	10.1007/978-3-540-68155-7_26
Official URL:	https://doi.org/10.1007/978-3-540-68155-7_26
Date Deposited:	18 Apr 2023 15:15
Last Modified:	14 May 2025 14:11

Cite in APA 7:	Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (2008, May). Using local search to speed up filtering algorithms for some NP-hard constraints [Paper]. 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), Paris, France. https://doi.org/10.1007/978-3-540-68155-7_26
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