Pages that link to "Item:Q4868799"
From MaRDI portal
The following pages link to Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming (Q4868799):
Displaying 26 items.
- Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing (Q703914) (← links)
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques (Q1283915) (← links)
- Lower bounds for nonlinear assignment problems using many body interactions (Q1291723) (← links)
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation (Q1609910) (← links)
- Implementation of an interior point method with basis preconditioning (Q2220915) (← links)
- Quasi-Newton approaches to interior point methods for quadratic problems (Q2322554) (← links)
- A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← 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)
- (Q4288560) (← links)
- The ‘Idiot’ crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems (Q5113712) (← links)
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)
- Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
- Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
- Taking advantage of symmetry in some quadratic assignment problems (Q5884391) (← links)
- Best reduction of the quadratic semi-assignment problem (Q5931788) (← links)
- The QAP-polytope and the star transformation (Q5939231) (← links)
