Cost Propagation – Numerical Propagation for Optimization Problems

DOI10.1007/978-3-540-68155-7_10zbMath1142.90472OpenAlexW1823050466MaRDI QIDQ5387624

Dag Wedelin, Birgit Grohe

Publication date: 27 May 2008

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-540-68155-7_10

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Cites Work

• Solving weighted CSP by maintaining arc consistency
• The design of a 0-1 integer optimizer and its application in the Carmen system
• Cost-based arc consistency for global cardinality constraints
• An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
• Nonserial dynamic programming
• The Role of Integer Programming Techniques in Constraint Programming's Global Constraints
• On the Foundations of Relaxation Labeling Processes
• Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm

This page was built for publication: Cost Propagation – Numerical Propagation for Optimization Problems