Pages that link to "Item:Q2770106"

The following pages link to Lower bounds for the quadratic assignment problem based upon a dual formulation (Q2770106):

Displaying 33 items.

• Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
• Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
• Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← links)
• A generalized Gilmore-Lawler procedure for the quadratic assignment problem (Q510938) (← links)
• The multi-story space assignment problem (Q610966) (← links)
• Selected topics on assignment problems (Q697571) (← links)
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
• A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
• Mapping the convergence of genetic algorithms (Q955480) (← links)
• Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
• A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
• An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
• Ranking scalar products to improve bounds for the quadratic assignment problem (Q1058988) (← links)
• Lower bounds for nonlinear assignment problems using many body interactions (Q1291723) (← links)
• A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800) (← links)
• Lower bounds for the quadratic assignment problem (Q1339141) (← links)
• Lower bounds based on linear programming for the quadratic assignment problem (Q1804578) (← links)
• A dual framework for lower bounds of the quadratic assignment problem based on linearization (Q1969301) (← links)
• The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
• RLT insights into lift-and-project closures (Q2257076) (← links)
• A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837) (← links)
• The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
• Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
• An exact qubit allocation approach for NISQ architectures (Q2684266) (← links)
• A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem (Q2815440) (← links)
• Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
• Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters (Q5139631) (← links)
• Taking advantage of symmetry in some quadratic assignment problems (Q5884391) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)