Pages that link to "Item:Q1361076"

The following pages link to QAPLIB - a quadratic assignment problem library (Q1361076):

Displaying 50 items.

• QAPLIB (Q13502) (← links)
• A feasible method for optimization with orthogonality constraints (Q101635) (← links)
• A hybrid biased random key genetic algorithm for the quadratic assignment problem (Q280940) (← links)
• A parallel ordering problem in facilities layout (Q336660) (← links)
• A nonmonotone GRASP (Q340011) (← links)
• Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← links)
• Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
• Autocorrelation measures for the quadratic assignment problem (Q429187) (← links)
• Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
• Interior point methods 25 years later (Q439546) (← links)
• An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
• A splitting method for orthogonality constrained problems (Q461228) (← links)
• On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
• Experimental analysis of crossover and mutation operators on the quadratic assignment problem (Q513133) (← links)
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047) (← links)
• Two classes of quadratic assignment problems that are solvable as linear assignment problems (Q665995) (← links)
• Selected topics on assignment problems (Q697571) (← links)
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
• To lay out or not to lay out? (Q763111) (← links)
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
• Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (Q823888) (← links)
• Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem (Q842713) (← links)
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• A branch-and-cut algorithm for quadratic assignment problems based on linearizations (Q856686) (← links)
• A note on a polynomial time solvable case of the quadratic assignment problem (Q865755) (← links)
• Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
• Generating QAP instances with known optimum solution and additively decomposable cost function (Q887857) (← links)
• Analog computation through high-dimensional physical chaotic neuro-dynamics (Q933433) (← links)
• Metaheuristic downhill simplex method in combinatorial optimization (Q941194) (← links)
• Convergence of a modified algorithm of fast probabilistic modeling (Q946727) (← links)
• Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040) (← links)
• A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
• Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
• A greedy genetic algorithm for the quadratic assignment problem (Q1577374) (← links)
• Solving multi objective facility layout problem by modified simulated annealing (Q1643306) (← links)
• Locating names on vertices of a transaction network (Q1683066) (← links)
• Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
• ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
• QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming (Q1741120) (← links)
• Special cases of the quadratic shortest path problem (Q1743483) (← links)
• Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907) (← links)
• BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
• Quantile and mean value measures of search process complexity (Q1752630) (← links)
• Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems (Q1789471) (← links)
• An extreme point algorithm for a local minimum solution to the quadratic assignment problem (Q1877896) (← links)
• A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
• Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)