Pages that link to "Item:Q2384611"
From MaRDI portal
The following pages link to The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611):
Displaying 15 items.
- On the Hamming distance in combinatorial optimization problems on hypergraph matchings (Q601985) (← links)
- The multi-story space assignment problem (Q610966) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- Lower bounds for the axial three-index assignment problem (Q1040985) (← links)
- Coordinated lab-clinics: a tactical assignment problem in healthcare (Q1695040) (← links)
- Probabilistic tabu search for the cross-docking assignment problem (Q1740539) (← links)
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs (Q1753507) (← links)
- Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems (Q1808370) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- On solving a hard quadratic 3-dimensional assignment problem (Q2516353) (← links)
- Parallel hybrid genetic algorithms for solving Q3AP on computational grid (Q2909213) (← links)
- Three Ideas for the Quadratic Assignment Problem (Q3144407) (← links)
- Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem (Q3649594) (← links)
- The three dimensional bottleneck assignment problem and its variants (Q3690581) (← links)
