Lower bounds for the quadratic semi-assignment problem
From MaRDI portal
Recommendations
Cites work
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
- Allocating programs containing branches and loops within a multiple processor system
- An algorithm for the multiprocessor assignment problem
- An efficient algorithm for a task allocation problem
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Methods of Nonlinear 0-1 Programming
- P-Complete Approximation Problems
- The Recognition of Series Parallel Digraphs
Cited in
(15)- A study of the quadratic semi-assignment polytope
- On lower bounds for a class of quadratic 0,1 programs
- A polynomially solvable class of quadratic semi-assignment problems
- Lower bounds for the quadratic assignment problem
- The Boolean quadratic programming problem with generalized upper bound constraints
- An exact algorithm for the minimum squared load assignment problem
- Lower bounds based on linear programming for the quadratic assignment problem
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Algorithm for quadratic semi-assignment problem with partition size coefficients
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem
- Tight Approximation Bounds for the Seminar Assignment Problem
- Algorithm for the discrete Weber's problem with an accuracy estimate
- A New Lower Bound for the Quadratic Assignment Problem
- Best reduction of the quadratic semi-assignment problem
This page was built for publication: Lower bounds for the quadratic semi-assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388830)
