Pages that link to "Item:Q807376"

The following pages link to QAPLIB-A quadratic assignment problem library (Q807376):

Displaying 37 items.

• QAPLIB (Q13502) (← links)
• Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
• Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• Optimization of the quadratic assignment problem using an ant colony algorithm (Q864790) (← links)
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
• Random assignment problems (Q953417) (← links)
• Backbone analysis and algorithm design for the quadratic assignment problem (Q954381) (← links)
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
• A parallel depth first search branch and bound algorithm for the quadratic assignment problem (Q1130079) (← links)
• One-dimensional machine location problems in a multi-product flowline with equidistant locations (Q1291754) (← links)
• A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
• BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
• A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
• Greedy randomized adaptive search procedures (Q1804580) (← links)
• A Lagrangian relaxation algorithm for sparse quadratic assignment problems (Q1904611) (← links)
• A modification of threshold accepting and its application to the quadratic assignment problem (Q1909011) (← links)
• Lower bounds for the quadratic assignment problem via triangle decompositions (Q1914071) (← links)
• A primal barrier function phase I algorithm for nonsymmetric conic optimization problems (Q1926650) (← links)
• 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
• Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method (Q2244972) (← links)
• Embedding signed graphs in the line (Q2253962) (← links)
• Ant colony optimization for solving an industrial layout problem (Q2371353) (← links)
• The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
• Local minima and convergence in low-rank semidefinite programming (Q2487849) (← links)
• COSEARCH: A parallel cooperative metaheuristic (Q2506211) (← links)
• Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
• Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (Q2643622) (← links)
• New variable-length data compression scheme for solution representation of meta-heuristics (Q2668691) (← links)
• PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID (Q2909213) (← links)
• Computing the Splitting Preconditioner for Interior Point Method Using an Incomplete Factorization Approach (Q4685741) (← links)
• An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
• A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP (Q5106411) (← links)
• Heuristics from Nature for Hard Combinatorial Optimization Problems (Q5690286) (← links)