The quadratic assignment problem
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Unit integer quadratic binary programming
- An exact algorithm for the general quadratic assignment problem
- On lower bounds for a class of quadratic 0,1 programs
- The facility layout problem
- A heuristic method for the multi-story layout problem
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- Contributions to the quadratic assignment problem
- A heuristic procedure for solving the quadratic assignment problem
- On the quadratic assignment problem
- Single and multiple period layout models for automated manufacturing systems
- A location problem on unicyclic networks: Balanced case
- Simulated annealing for machine layout problems in the presence of zoning constraints
- Layout design for flexible manufacturing systems
- A distance assignment approach to the facility layout problem
- Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem
- Generating quadratic assignment test problems with known optimal permutations
- Algorithms for robust single and multiple period layout planning for manufacturing systems
- An interactive layout heuristic based on hexagonal adjacency graphs
- Integer programming formulation of combinatorial optimization problems
- An algorithm for the quadratic assignment problem using Benders' decomposition
- A solvable case of the quadratic assignment problem
- Optimizing simulated annealing schedules with genetic programming
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- Network-based formulations of the quadratic assignment problem
- Lower bounds for nonlinear assignment problems using many body interactions
- A GRASP for the biquadratic assignment problem
- Move based heuristics for the unidirectional loop network layout problem
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- A variant of time minimizing assignment problem
- A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system
- Strengthening Gilmore's bound for the quadratic assignment problem
- Lower bounds for the quadratic assignment problem
- A new exact algorithm for the solution of quadratic assignment problems
- Solution methods for the balancing of jet turbines
- A classification of formulations for the (time-dependent) traveling salesman problem
- A heuristic procedure for the single-row facility layout problem
- FACOPT: A user friendly FACility layout OPTimization system.
- A greedy genetic algorithm for the quadratic assignment problem
- A novel chaotic search for quadratic assignment problems
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
- Tabu search and iterated local search for the cyclic bottleneck assignment problem
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- A -accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics
- Locating names on vertices of a transaction network
- Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes
- An exact algorithm for the minimum squared load assignment problem
- Natalie 2.0: sparse global network alignment as a special case of quadratic assignment
- ADMM for the SDP relaxation of the QAP
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- The quadratic shortest path problem: complexity, approximability, and solution methods
- New linearizations of quadratic assignment problems
- Measuring instance difficulty for combinatorial optimization problems
- Extended neighborhood: Definition and characterization
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- Posterior agreement for large parameter-rich optimization problems
- Lower bounds based on linear programming for the quadratic assignment problem
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems
- Lower bounds for the quadratic assignment problem via triangle decompositions
- A new greedy algorithm for the quadratic assignment problem
- Seeking affinity structure: strategies for improving \(m\)-best graph matching
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Image matching from handcrafted to deep features: a survey
- The linearization problem of a binary quadratic problem and its applications
- Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
- A new class of hard problem instances for the 0-1 knapsack problem
- Disentangling relationships in symptom networks using matrix permutation methods
- Statistical shape analysis of brain arterial networks (BAN)
- The quadratic cycle cover problem: special cases and efficient bounds
- RLT insights into lift-and-project closures
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
- A hybrid heuristic for the facilities layout problem
- A parallel heuristic for quadratic assignment problems
- A priority based unbalanced time minimization assignment problem
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
- Linear programming insights into solvable cases of the quadratic assignment problem
- A revised reformulation-linearization technique for the quadratic assignment problem
- Genetic algorithm for linear and cyclic assignment problem
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- A fast projected fixed-point algorithm for large graph matching
- Integrating combinatorial algorithms into a linear programming solver
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique
- Exact procedures for solving the discrete ordered median problem
- Single- and multi-objective facility layout with workflow interference considerations
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- An algorithm for indefinite integer quadratic programming
- Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence
- SDP relaxations for some combinatorial optimization problems
- GRASP with path-relinking for facility layout
- L_p-norm regularization algorithms for optimization over permutation matrices
- A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
- Parallel hybrid genetic algorithms for solving Q3AP on computational grid
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- Exact solution of emerging quadratic assignment problems
- Maximizing Polynomials Subject to Assignment Constraints
- A layout design heuristic employing the theory of fuzzy sets
This page was built for publication: The quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778995)
