Where the really hard quadratic assignment problems are: the QAP-SAT instances

DOI10.1007/978-3-031-57712-3_9MaRDI QIDQ6635983

Sébastien Verel, Sarah L. Thomson, Omar Rifki

Publication date: 12 November 2024

zbMATH Keywords

phase transitionquadratic assignment problem

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
• A survey for the quadratic assignment problem
• QAPLIB - a quadratic assignment problem library
• The TSP phase transition
• A greedy genetic algorithm for the quadratic assignment problem
• Phase transitions and complexity in computer science: An overview of the statistical physics approach to the random satisfiability problem
• Measuring instance difficulty for combinatorial optimization problems
• The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
• Assignment Problems and the Location of Economic Activities
• Comparison of iterative searches for the quadratic assignment problem
• Phase Transitions in Parameter Rich Optimization Problems
• Determining computational complexity from characteristic ‘phase transitions’
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: Where the really hard quadratic assignment problems are: the QAP-SAT instances

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