The bipartite quadratic assignment problem and extensions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 714526 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 3338972 (Why is no real title available?)
- A hybrid metaheuristic approach to solving the UBQP problem
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
- A new approach for modeling and solving set packing problems
- A new modeling and solution approach for the set-partitioning problem
- A polynomially solvable class of quadratic semi-assignment problems
- A quadratic assignment problem without column constraints
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- A study of the quadratic semi-assignment polytope
- A survey of very large-scale neighborhood search techniques
- A unified modeling and solution framework for combinatorial optimization problems
- Adaptive memory tabu search for binary quadratic programs
- Algorithm for quadratic semi-assignment problem with partition size coefficients
- Assignment Problems
- Assignment Problems and the Location of Economic Activities
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- Breakout local search for the quadratic assignment problem
- Domination analysis of algorithms for bipartite Boolean quadratic programs
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- Generalized bilinear programming: An application in farm management
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- Maximization of A convex quadratic function under linear constraints
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Path relinking for unconstrained binary quadratic programming
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- The quadratic assignment problem
- The quadratic assignment problem. Theory and algorithms
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
Cited in
(10)- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
- Combinatorial optimization with interaction costs: complexity and solvable cases
- Less is more: tabu search for Bipartite Qudratic Programming problem
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
- An exact algorithm for the minimum squared load assignment problem
- The Bipartite Rationing Problem
- Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
This page was built for publication: The bipartite quadratic assignment problem and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322542)
