Principles and Practice of Constraint Programming – CP 2004
From MaRDI portal
Publication:5900323
DOI10.1007/b100482zbMath1152.68584MaRDI 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
90C59: Approximation methods and heuristics in mathematical programming
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Improved filtering for weighted circuit constraints, A \texttt{cost-regular} based hybrid column generation approach, New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach, Approximated consistency for the automatic recording constraint, Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates, Constraint programming and operations research, Domain reduction techniques for global NLP and MINLP optimization, A first look at picking dual variables for maximizing reduced cost fixing, Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach, New exact techniques applied to a class of network flow formulations, Grammar constraints, A Lagrangian propagator for artificial neural networks in constraint programming, Cost-based filtering for shorter path constraints, Exact solution of network flow models with strong relaxations