Singleton node consistency for quadratic assignment problems in cost function networks

DOI10.1007/978-3-032-27242-3_31MaRDI QIDQ7356186zbMATH OpenFDO

Authors Guidio Sewa, David Allouche, Simon de Givry, George Katsirelos, Thomas Schiex

Publication date 23 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27242-3_31

Mathematics Subject Classification ID

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

Cites work

• A branch-and-cut algorithm for quadratic assignment problems based on linearizations
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• A new relaxation framework for quadratic assignment problems based on matrix splitting
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
• A survey for the quadratic assignment problem
• Assignment Problems and the Location of Economic Activities
• Cost-based arc consistency for global cardinality constraints
• Design, implementation, and evaluation of the constraint language cc(FD)
• Efficient algorithms for singleton arc consistency
• Gilmore-Lawler bound of quadratic assignment problem
• Handbook of constraint programming.
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Multi-language evaluation of exact solvers in graphical model discrete optimization
• Multiple-choice knapsack constraint in graphical models
• On the quadratic assignment problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Principles and practice of constraint programming -- CP 2002. 8th international conference, CP 2002, Ithaca, NY, USA, September 9--13, 2002. Proceedings.
• Reasoning from last conflict(s) in constraint programming
• Relaxation-aware heuristics for exact optimization in graphical models
• Soft arc consistency revisited
• Super-reparametrizations of weighted CSPs: properties and optimization perspective
• Theoretical analysis of singleton arc consistency and its extensions
• Three Ideas for the Quadratic Assignment Problem
• Valued constraint satisfaction problems

This page was built for publication: Singleton node consistency for quadratic assignment problems in cost function networks

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