Pages that link to "Item:Q5931788"
From MaRDI portal
The following pages link to Best reduction of the quadratic semi-assignment problem (Q5931788):
Displaying 13 items.
- A survey for the quadratic assignment problem (Q852928) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints (Q2668740) (← links)
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem (Q2958360) (← links)
- Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
- Inductive linearization for binary quadratic programs with linear constraints: a computational study (Q6489313) (← links)