Pages that link to "Item:Q5728874"

The following pages link to Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem (Q5728874):

Displaying 48 items.

• A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system (Q1318457) (← links)
• Strengthening Gilmore's bound for the quadratic assignment problem (Q1333480) (← links)
• Lower bounds for the quadratic assignment problem (Q1339141) (← links)
• A new exact algorithm for the solution of quadratic assignment problems (Q1343146) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• Solution methods for the balancing of jet turbines (Q1373895) (← links)
• Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation (Q1609910) (← links)
• The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341) (← links)
• A convex form of the quadratic assignment problem (Q1804071) (← links)
• Lower bounds based on linear programming for the quadratic assignment problem (Q1804578) (← links)
• Semantic relatedness (Q1842807) (← links)
• A Lagrangian relaxation algorithm for sparse quadratic assignment problems (Q1904611) (← links)
• Lower bounds for the quadratic assignment problem via triangle decompositions (Q1914071) (← links)
• Optimal sequences in stochastic single machine shops (Q1919778) (← links)
• The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
• Disentangling relationships in symptom networks using matrix permutation methods (Q2141642) (← links)
• The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
• RLT insights into lift-and-project closures (Q2257076) (← links)
• Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297) (← links)
• A hybrid heuristic for the facilities layout problem (Q2276871) (← links)
• A parallel heuristic for quadratic assignment problems (Q2276872) (← links)
• Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
• The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
• Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
• Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique (Q2467428) (← links)
• Single- and multi-objective facility layout with workflow interference considerations (Q2503216) (← 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)
• SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
• A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697) (← links)
• FALSA-facilities allocation by statistical analysis Part I. Further investigations on the cost distribution associated with the problem of facilities design (Q3328209) (← links)
• FALSA-Facilities allocation by statistical analysis Part II. An heuristic algorithm to the problem of facilities design (Q3328210) (← links)
• Cotas inferiores para el QAP-Arbol (Q3354500) (← links)
• A contribution to quadratic assignment problems (Q3362092) (← 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)
• Multiple objective programming for the quadratic assignment problem (Q3767144) (← links)
• Near-optimal heuristics for an assignment problem in mass storage (Q4065020) (← links)
• Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme (Q4071009) (← links)
• A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem (Q4394217) (← links)
• Reconfigurable layout problem (Q4666772) (← links)
• Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
• Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
• Taking advantage of symmetry in some quadratic assignment problems (Q5884391) (← links)
• The QAP-polytope and the star transformation (Q5939231) (← links)
• Gilmore-Lawler bound of quadratic assignment problem (Q6059115) (← links)
• An efficient heuristic for the \(k\)-partitioning problem (Q6063777) (← links)
• A quadratic simplex algorithm for primal optimization over zero-one polytopes (Q6202952) (← links)