scientific article; zbMATH DE number 2084723

zbMath1067.68663MaRDI QIDQ4475652

Christian Bessiere, Jean-Charles Régin, Thierry Petit

Publication date: 9 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2239/22390451.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (16)

Gallai-Edmonds decomposition as a pruning technique ⋮ Tractability-preserving transformations of global cost functions ⋮ Reformulation of global constraints based on constraints checkers ⋮ Filtering algorithms for the NValue constraint ⋮ A \texttt{cost-regular} based hybrid column generation approach ⋮ A constraint programming based column generation approach to nurse rostering problems ⋮ Discrete convexity in joint winner property ⋮ Global constraint catalogue: past, present and future ⋮ Human-centred feasibility restoration in practice ⋮ Contractibility for open global constraints ⋮ Hybrid tractability of valued constraint problems ⋮ Bounds of graph parameters for global constraints ⋮ Dulmage-Mendelsohn canonical decomposition as a generic pruning technique ⋮ Global propagation of side constraints for solving over-constrained problems ⋮ On global warming: Flow-based soft global constraints ⋮ Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction

This page was built for publication: