Pages that link to "Item:Q1761235"
From MaRDI portal
The following pages link to New linearizations of quadratic assignment problems (Q1761235):
Displaying 13 items.
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← 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)
- Generating QAP instances with known optimum solution and additively decomposable cost function (Q887857) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- Network-based formulations of the quadratic assignment problem (Q1291651) (← links)
- A new form of the quadratic assignment problem and approximate solutions (Q1407127) (← links)
- Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
- A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- Selection hyper-heuristics for the multi and many-objective quadratic assignment problem (Q2676362) (← links)
- A new linearization method for quadratic assignment problems (Q3423596) (← links)
- (Q3626447) (← links)