Pages that link to "Item:Q3423596"
From MaRDI portal
The following pages link to A new linearization method for quadratic assignment problems (Q3423596):
Displaying 9 items.
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← links)
- Improving hospital layout planning through clinical pathway mining (Q1639251) (← links)
- On linearization techniques for budget-constrained binary quadratic programming problems (Q1709935) (← links)
- A geometric branch-and-bound algorithm for the service bundle design problem (Q2160490) (← links)
- On solving a hard quadratic 3-dimensional assignment problem (Q2516353) (← links)
- $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices (Q2832890) (← links)
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
- Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
- Gilmore-Lawler bound of quadratic assignment problem (Q6059115) (← links)
