Local branching in a constraint programming framework

DOI10.4230/LIPICS.ICLP.2010.286MaRDI QIDQ2883108zbMATH OpenOpenAlexFDO

Authors Fabio Parisini

Publication date 11 May 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_196e.html

zbMATH Keywords

local searchconstraint programminglocal branchingtree searchLDS

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Bounding, filtering and diversification in CP-based local branching
• A constraint programming framework for local search methods
• Local branching
• Constraint Programming and Local Search Hybrids
• Improved local search for CP toolkits

Cited in

(4)

• A constraint programming framework for local search methods
• Local branching
• Integrating local search techniques into mixed integer programming. (Thesis)
• Bounding, filtering and diversification in CP-based local branching

This page was built for publication: Local branching in a constraint programming framework

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