Pages that link to "Item:Q1013294"
From MaRDI portal
The following pages link to A study of the quadratic semi-assignment polytope (Q1013294):
Displaying 16 items.
- The bipartite quadratic assignment problem and extensions (Q322542) (← links)
- Algorithm for the discrete Weber's problem with an accuracy estimate (Q329214) (← links)
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems (Q1026110) (← links)
- The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
- An exact algorithm for the minimum squared load assignment problem (Q1734825) (← links)
- Perspectives on modeling hub location problems (Q2029941) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
- On the SQAP-polytope (Q2706338) (← links)
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q2980928) (← links)
- Generalized network design polyhedra (Q3100692) (← links)
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q4622772) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes (Q5865703) (← links)
- Box-inequalities for quadratic assignment polytopes (Q5955568) (← links)