The bipartite quadratic assignment problem and extensions
From MaRDI portal
Publication:322542
DOI10.1016/j.ejor.2015.10.006zbMath1346.90518OpenAlexW1795817323MaRDI QIDQ322542
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.10.006
Integer programming (90C10) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (7)
Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis ⋮ An exact algorithm for the minimum squared load assignment problem ⋮ Combinatorial optimization with interaction costs: complexity and solvable cases ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search ⋮ Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- A hybrid metaheuristic approach to solving the UBQP problem
- A survey of very large-scale neighborhood search techniques
- A study of the quadratic semi-assignment polytope
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Generalized bilinear programming: An application in farm management
- A polynomially solvable class of quadratic semi-assignment problems
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
- Variable neighborhood search
- The quadratic assignment problem. Theory and algorithms
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- A unified modeling and solution framework for combinatorial optimization problems
- Path relinking for unconstrained binary quadratic programming
- Breakout local search for the quadratic assignment problem
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Algorithm for quadratic semi-assignment problem with partition size coefficients
- A new modeling and solution approach for the set-partitioning problem
- A new approach for modeling and solving set packing problems
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- The Quadratic Assignment Problem
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs
- Assignment Problems and the Location of Economic Activities
- Assignment Problems
- Maximization of A convex quadratic function under linear constraints
- A quadratic assignment problem without column constraints
- Variable neighborhood search: Principles and applications
This page was built for publication: The bipartite quadratic assignment problem and extensions
