Principles and Practice of Constraint Programming – CP 2004
From MaRDI portal
Publication:5900323
DOI10.1007/b100482zbMath1152.68584OpenAlexW1508891358MaRDI QIDQ5900323
Publication date: 9 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100482
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (14)
Constraint programming and operations research ⋮ A \texttt{cost-regular} based hybrid column generation approach ⋮ A Lagrangian propagator for artificial neural networks in constraint programming ⋮ New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach ⋮ Exact solution of network flow models with strong relaxations ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Cost-based filtering for shorter path constraints ⋮ Improved filtering for weighted circuit constraints ⋮ A first look at picking dual variables for maximizing reduced cost fixing ⋮ Grammar constraints ⋮ Approximated consistency for the automatic recording constraint ⋮ Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach ⋮ New exact techniques applied to a class of network flow formulations ⋮ Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
This page was built for publication: Principles and Practice of Constraint Programming – CP 2004
