Pages that link to "Item:Q4732306"
From MaRDI portal
The following pages link to An Exact Algorithm for the Quadratic Assignment Problem on a Tree (Q4732306):
Displaying 18 items.
- On a quadratic programming problem involving distances in trees (Q338937) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
- Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
- Continuation methods for approximate large scale object sequencing (Q669313) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040) (← links)
- A greedy genetic algorithm for the quadratic assignment problem (Q1577374) (← links)
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907) (← links)
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles (Q1799950) (← links)
- A mathematical model and a heuristic procedure for the turbine balancing problem (Q1804061) (← links)
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems (Q1904611) (← links)
- Convergence of the surrogate Lagrangian relaxation method (Q2260658) (← links)
- Quadratic assignment problems on series-parallel digraphs (Q3730344) (← links)
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem (Q4427381) (← links)
- An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
- An efficient algorithm for unequal area facilities layout planning with input and output points (Q5884349) (← links)
- A mixed-integer programming formulation for optimizing the double row layout problem (Q6661116) (← links)
