Pages that link to "Item:Q3423596"

The following pages link to A new linearization method for quadratic assignment problems (Q3423596):

Displaying 25 items.

• Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← links)
• Linear models and computational experiments for the quadratic TSP (Q510950) (← links)
• Two classes of quadratic assignment problems that are solvable as linear assignment problems (Q665995) (← links)
• A branch-and-cut algorithm for quadratic assignment problems based on linearizations (Q856686) (← links)
• Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
• Improving hospital layout planning through clinical pathway mining (Q1639251) (← links)
• A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
• On linearization techniques for budget-constrained binary quadratic programming problems (Q1709935) (← links)
• Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
• New linearizations of quadratic assignment problems (Q1761235) (← links)
• A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← 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)
• A geometric branch-and-bound algorithm for the service bundle design problem (Q2160490) (← links)
• A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837) (← links)
• Compact linearization for binary quadratic problems (Q2477615) (← links)
• On solving a hard quadratic 3-dimensional assignment problem (Q2516353) (← links)
• A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
• An efficient continuation method for quadratic assignment problems (Q2654391) (← links)
• A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem (Q2807873) (← links)
• \(L_p\)-norm regularization algorithms for optimization over permutation matrices (Q2832890) (← links)
• The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
• (Q3626447) (← links)
• Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
• Gilmore-Lawler bound of quadratic assignment problem (Q6059115) (← links)