Pages that link to "Item:Q1403282"
From MaRDI portal
The following pages link to Recent advances in the solution of quadratic assignment problems (Q1403282):
Displayed 38 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
- On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047) (← links)
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (Q621965) (← links)
- Global optimization of a class of nonconvex quadratically constrained quadratic programming problems (Q644622) (← links)
- The random quadratic assignment problem (Q658428) (← links)
- Continuation methods for approximate large scale object sequencing (Q669313) (← links)
- Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
- Biological computation of the solution to the quadratic assignment problem (Q929455) (← links)
- Random assignment problems (Q953417) (← links)
- Repulsive assignment problem (Q963661) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
- New linearizations of quadratic assignment problems (Q1761235) (← links)
- A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Local minima and convergence in low-rank semidefinite programming (Q2487849) (← links)
- An efficient continuation method for quadratic assignment problems (Q2654391) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices (Q2832890) (← links)
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
- Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems (Q5038440) (← links)
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded (Q5085481) (← links)
- Gilmore-Lawler bound of quadratic assignment problem (Q6059115) (← links)
- On the generalized trace ratio problem (Q6062858) (← links)