Pages that link to "Item:Q852928"

The following pages link to A survey for the quadratic assignment problem (Q852928):

Displaying 50 items.

• New linearizations of quadratic assignment problems (Q1761235) (← links)
• Discrete and geometric branch and bound algorithms for~medical image registration (Q1761852) (← links)
• The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics (Q1762023) (← links)
• Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems (Q1789471) (← links)
• A fast algorithm to generate feasible solution of production facilities layout based on plane segmentation (Q1792742) (← links)
• A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem (Q1821011) (← links)
• Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach (Q1850122) (← links)
• A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
• Linear and quadratic programming approaches for the general graph partitioning problem (Q1959249) (← links)
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
• Image matching from handcrafted to deep features: a survey (Q2056423) (← links)
• Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
• Who should get vaccinated? Individualized allocation of vaccines over SIR network (Q2106396) (← links)
• Finding optimal solutions to several gray pattern instances (Q2115324) (← links)
• A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
• Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
• A survey of hidden convex optimization (Q2176821) (← links)
• Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
• Decorous combinatorial lower bounds for row layout problems (Q2189888) (← links)
• An efficient variable neighborhood search for the space-free multi-row facility layout problem (Q2242375) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• Embedding signed graphs in the line (Q2253962) (← links)
• QPLIB: a library of quadratic programming instances (Q2281448) (← links)
• New exact approaches to row layout problems (Q2295979) (← 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 cooperative parallel tabu search algorithm for the quadratic assignment problem (Q2378423) (← links)
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
• Dual track and segmented single track bidirectional loop guidepath layout for AGV systems (Q2426526) (← links)
• Complete description for the spanning tree problem with one linearised quadratic term (Q2450761) (← links)
• An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
• Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique (Q2467428) (← links)
• Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
• Using constraint programming for the design of network-on-chip architectures (Q2515807) (← links)
• Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly (Q2517416) (← 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)
• An exact qubit allocation approach for NISQ architectures (Q2684266) (← links)
• Garden optimization problems for benchmarking quantum annealers (Q2685606) (← links)
• A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem (Q2815440) (← 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)
• A memetic heuristic for the generalized quadratic assignment problem (Q2892300) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
• A relative position-coded differential evolution for loop-based station sequencing problem (Q3163180) (← links)
• The generalised machine layout problem (Q3163382) (← links)
• SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration (Q3163728) (← links)