The following pages link to Min Li (Q1043568):
Displaying 39 items.
- (Q344568) (redirect page) (← links)
- Inexact feasibility pump for mixed integer nonlinear programming (Q344569) (← links)
- Fully cycle extendability of \(K_{1,4}\)-restricted graphs (Q1043569) (← links)
- Approximation algorithms for maximum coverage with group budget constraints (Q1708624) (← links)
- Approximation algorithms for the robust facility leasing problem (Q1749787) (← links)
- Inexact solution of NLP subproblems in MINLP (Q1942026) (← links)
- Approximation algorithms for fuzzy \(C\)-means problem based on seeding method (Q1981782) (← links)
- A bi-criteria analysis for fuzzy \(C\)-means problem (Q2039654) (← links)
- The approximation algorithm based on seeding method for functional \(k\)-means problem (Q2076447) (← links)
- The bi-criteria seeding algorithms for two variants of \(k\)-means problem (Q2082186) (← links)
- The seeding algorithm for spherical \(k\)-means clustering with penalties (Q2082212) (← links)
- The submodularity of two-stage stochastic maximum-weight independent set problems (Q2089673) (← links)
- Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy (Q2091111) (← links)
- A novel initialization algorithm for fuzzy \(C\)-means problem (Q2110712) (← links)
- A primal-dual algorithm for Euclidean \(k\)-means problem with penalties (Q2110737) (← links)
- Two-stage stochastic max-weight independent set problems (Q2149870) (← links)
- Approximation algorithm for min-max correlation clustering problem with outliers (Q2150588) (← links)
- Bi-criteria adaptive algorithms for minimizing supermodular functions with cardinality constraint (Q2151371) (← links)
- Approximation algorithms for two variants of correlation clustering problem (Q2156281) (← links)
- An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space (Q2165794) (← links)
- Approximation algorithms for spherical \(k\)-means problem using local search scheme (Q2220852) (← links)
- The seeding algorithm for \(k\)-means problem with penalties (Q2292125) (← links)
- The seeding algorithm for Functional \(k\)-Means problem (Q2300054) (← links)
- The seeding algorithms for spherical \(k\)-means clustering (Q2307745) (← links)
- Efficient approximation algorithms for maximum coverage with group budget constraints (Q2317355) (← links)
- A note on submodularity preserved involving the rank functions (Q2326075) (← links)
- On the double Roman domination of graphs (Q2335792) (← links)
- Approximation algorithm for squared metric two-stage stochastic facility location problem (Q2424830) (← links)
- Stochastic-lazier-greedy algorithm for monotone non-submodular maximization (Q2666680) (← links)
- On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints (Q2697144) (← links)
- (Q3436693) (← links)
- An improved primal-dual approximation algorithm for the <i>k</i>-means problem with penalties (Q5048009) (← links)
- A survey on theory and algorithms for bm$k$-means problems (Q5064238) (← links)
- The Parallel Seeding Algorithm for k-Means Problem with Penalties (Q5149519) (← links)
- (Q5276743) (← links)
- Approximation Algorithms for Matroid and Knapsack Means Problems (Q6053494) (← links)
- Optimal Rejection of Bounded Perturbations in Linear Leader-Following Consensus Protocol: Method Invariant Ellipsoid (Q6522507) (← links)
- A second-order linear unconditionally energy-stable scheme for the phase field crystal equation (Q6633280) (← links)
- A family of limited memory three term conjugate gradient methods (Q6661110) (← links)
