Pages that link to "Item:Q2401517"
From MaRDI portal
The following pages link to Minimizing differences of convex functions with applications to facility location and clustering (Q2401517):
Displaying 7 items.
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering (Q1749775) (← links)
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique (Q1756799) (← links)
- Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems (Q2043907) (← links)
- Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
- Clustering and multifacility location with constraints via distance function penalty methods and dc programming (Q4646536) (← links)
- Solving a continuous multifacility location problem by DC algorithms (Q5038184) (← links)
- (Q5866396) (← links)