The following pages link to (Q4247442):
Displaying 14 items.
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering (Q628745) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← 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)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- Models and algorithms for the product pricing with single-minded customers requesting bundles (Q2027005) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- A unified model for Weber problems with continuous and network distances (Q2384880) (← links)
- A global optimization RLT-based approach for solving the hard clustering problem (Q2576449) (← links)
- (Q3002153) (← links)
- (Q3139136) (← links)
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)
- A Complementary Column Generation Approach for the Graph Equipartition Problem (Q5155466) (← links)
