Characterization and Automation of Matching-Based Neighborhoods

DOI10.1007/978-3-642-13520-0_7MaRDI QIDQ3569918zbMATH OpenOpenAlexFDO

Authors Thierry Benoist

Publication date 22 June 2010

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13520-0_7

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Algorithms for the optimal identification of segment neighborhoods
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
• Model-based automatic neighborhood design by unsupervised learning
• Data-mining-driven neighborhood search
• Neighborhood selection methods
• Neighbourhood SAC: extensions and new algorithms
• Neighborhoods for distance transformations using ordered propagation

Cited in

(3)

• Constraint-based very large-scale neighborhood search
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
• Model-based automatic neighborhood design by unsupervised learning

Describes a project that uses

Uses Software

• LocalSolver

This page was built for publication: Characterization and Automation of Matching-Based Neighborhoods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569918)