Pages that link to "Item:Q2516353"
From MaRDI portal
The following pages link to On solving a hard quadratic 3-dimensional assignment problem (Q2516353):
Displaying 8 items.
- Linear programming based time lag identification in event sequences (Q1716564) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems (Q1808370) (← links)
- Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← links)
- The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
- Three Ideas for the Quadratic Assignment Problem (Q3144407) (← links)
- On Asymptotically Optimal Algorithm for One Modification of Planar 3-dimensional Assignment Problem (Q5391757) (← links)