Pages that link to "Item:Q1361076"

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

Displaying 50 items.

• 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
• Finding optimal solutions to several gray pattern instances (Q2115324) (← links)
• Leveraging special-purpose hardware for local search heuristics (Q2125062) (← links)
• Penalty weights in QUBO formulations: permutation problems (Q2163796) (← links)
• \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance (Q2163799) (← links)
• A landscape-based analysis of fixed temperature and simulated annealing (Q2171587) (← links)
• A cutoff time strategy based on the coupon collector's problem (Q2184095) (← links)
• A penalty-based multi-objectivization approach for single objective optimization (Q2198019) (← links)
• QPLIB: a library of quadratic programming instances (Q2281448) (← links)
• On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem (Q2285657) (← links)
• On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope (Q2288199) (← links)
• Lagrangian relaxation graph matching (Q2289603) (← links)
• Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
• A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837) (← links)
• A multi-parent genetic algorithm for the quadratic assignment problem (Q2359229) (← links)
• A cooperative parallel tabu search algorithm for the quadratic assignment problem (Q2378423) (← links)
• Integrating combinatorial algorithms into a linear programming solver (Q2418164) (← links)
• A parallel water flow algorithm with local search for solving the quadratic assignment problem (Q2423282) (← links)
• A hybrid metaheuristic for the quadratic assignment problem (Q2506186) (← links)
• Modelling convex shape priors and matching based on the Gromov-Wasserstein distance (Q2513328) (← links)
• Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
• A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← 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)
• \(L_p\)-norm regularization algorithms for optimization over permutation matrices (Q2832890) (← links)
• A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697) (← links)
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem (Q2958360) (← links)
• SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration (Q3163728) (← links)
• A new linearization method for quadratic assignment problems (Q3423596) (← links)
• A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
• Two-level modified simulated annealing based approach for solving facility layout problem (Q3498919) (← links)
• IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM (Q3528981) (← links)
• A Conjugate Gradient Method for Electronic Structure Calculations (Q4595782) (← links)
• Probabilistic stopping rules for GRASP heuristics and extensions (Q4924054) (← links)
• An analysis of parameter adaptation in reactive tabu search (Q4979993) (← links)
• Scalable Semidefinite Programming (Q4999352) (← links)
• Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software (Q5058403) (← links)
• PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form (Q5094999) (← links)
• A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique (Q5131697) (← links)
• Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study (Q5131726) (← 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)
• An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems (Q5140142) (← links)
• Coarse-Graining Large Search Landscapes Using Massive Edge Collapse (Q5147729) (← links)
• Experiments on the minimum linear arrangement problem (Q5463444) (← links)
• Optimal Mass Transport for Activities Location Problem (Q5855862) (← links)
• Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)