Pages that link to "Item:Q1130079"
From MaRDI portal
The following pages link to A parallel depth first search branch and bound algorithm for the quadratic assignment problem (Q1130079):
Displaying 14 items.
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture (Q757239) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm (Q965550) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- A parallel branch and bound algorithm for the quadratic assignment problem (Q1095791) (← links)
- Parallel processing for difficult combinatorial optimization problems (Q1268289) (← links)
- Solving large-scale QAP problems in parallel with the serach library ZRAM (Q1268834) (← links)
- Solving large quadratic assignment problems in parallel (Q1366297) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- A cooperative parallel tabu search algorithm for the quadratic assignment problem (Q2378423) (← links)
- The fuzzy quadratic assignment problem with penalty: new models and genetic algorithm (Q2489363) (← links)
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique (Q5131697) (← links)
- Building a parallel branch and bound library (Q6560211) (← links)
