Pages that link to "Item:Q1116236"
From MaRDI portal
The following pages link to On clustering problems with connected optima in Euclidean spaces (Q1116236):
Displaying 14 items.
- A new approach to solve open-partition problems (Q434191) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors (Q1026115) (← links)
- Localizing combinatorial properties of partitions (Q1126278) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Direct product decompositions of lattices, closures and relation schemes (Q1210557) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- A randomized approximation scheme for metric MAX-CUT (Q1604207) (← links)
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables (Q1628128) (← links)
- Enumerating nested and consecutive partitions (Q1805062) (← links)
- Optimal separable partitioning in the plane (Q1893156) (← links)
- Sphere-separable partitions of multi-parameter elements (Q2478428) (← links)
- Strongly 2-shape-sortability of vector partitions (Q2479569) (← links)
- ON RECTANGULAR COVERING PROBLEMS (Q3401889) (← links)
