Pages that link to "Item:Q1296800"

The following pages link to A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800):

Displaying 16 items.

• Probabilistic subproblem selection in branch-and-bound algorithms (Q557739) (← links)
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← 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)
• Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm (Q965550) (← links)
• Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
• An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
• A new adaptive Hungarian mating scheme in genetic algorithms (Q1726046) (← links)
• New linearizations of quadratic assignment problems (Q1761235) (← links)
• The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
• RLT insights into lift-and-project closures (Q2257076) (← links)
• The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
• The fuzzy quadratic assignment problem with penalty: new models and genetic algorithm (Q2489363) (← links)
• A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
• A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique (Q5131697) (← links)