Pages that link to "Item:Q1804578"
From MaRDI portal
The following pages link to Lower bounds based on linear programming for the quadratic assignment problem (Q1804578):
Displaying 20 items.
- A generalized Gilmore-Lawler procedure for the quadratic assignment problem (Q510938) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- On lower bounds for a class of quadratic 0,1 programs (Q1072937) (← links)
- Strengthening Gilmore's bound for the quadratic assignment problem (Q1333480) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- A dual framework for lower bounds of the quadratic assignment problem based on linearization (Q1969301) (← links)
- The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
- Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- Equivalence of some LP-based lower bounds for the Golomb ruler problem (Q2581563) (← links)
- Approximating the minimum quadratic assignment problems (Q2930294) (← links)
- A New Lower Bound for the Quadratic Assignment Problem (Q3990559) (← links)
- A New Lower Bound Via Projection for the Quadratic Assignment Problem (Q4022029) (← links)
- Dynamic programming and lower-bound approaches to the minimum binding problem (Q4653194) (← links)
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming (Q4868799) (← links)
- Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
- (Q5688490) (← links)
- The QAP-polytope and the star transformation (Q5939231) (← links)
