Pages that link to "Item:Q1849534"

The following pages link to Solving large quadratic assignment problems on computational grids (Q1849534):

Displaying 50 items.

• Variable neighborhood search for the workload balancing problem in service enterprises (Q337226) (← links)
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047) (← links)
• The MIN-cut and vertex separator problem (Q683339) (← links)
• Loop based facility planning and material handling (Q707078) (← links)
• GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
• Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← 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)
• Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
• Mapping the convergence of genetic algorithms (Q955480) (← links)
• Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
• A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
• Analysis of stochastic problem decomposition algorithms in computational grids (Q1026583) (← links)
• \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
• SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
• New linearizations of quadratic assignment problems (Q1761235) (← links)
• Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
• A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
• A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
• Assignment problems with changeover cost (Q2267319) (← links)
• A convex optimisation framework for the unequal-areas facility layout problem (Q2275810) (← links)
• On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem (Q2285657) (← links)
• Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
• A cooperative parallel tabu search algorithm for the quadratic assignment problem (Q2378423) (← links)
• Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem (Q2456632) (← links)
• Iterated local search for the quadratic assignment problem (Q2503224) (← links)
• The empirical behavior of sampling methods for stochastic programming (Q2507414) (← links)
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
• A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
• An efficient continuation method for quadratic assignment problems (Q2654391) (← links)
• New variable-length data compression scheme for solution representation of meta-heuristics (Q2668691) (← links)
• Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q2673239) (← links)
• SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
• A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697) (← links)
• A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
• Optimised Recovery with a Coordinated Checkpoint/Rollback Protocol for Domain Decomposition Applications (Q3627745) (← links)
• Challenges in Enterprise Wide Optimization for the Process Industries (Q3638498) (← links)
• An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
• A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM (Q4923294) (← links)
• Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (Q5057997) (← links)
• Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded (Q5085481) (← links)
• A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique (Q5131697) (← links)
• Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
• Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters (Q5139631) (← links)
• Order Scheduling Models: Hardness and Algorithms (Q5458825) (← links)
• Taking advantage of symmetry in some quadratic assignment problems (Q5884391) (← links)