Algorithmic complexity: threeNP- hard problems in computational statistics

From MaRDI portal
Publication:3940795

DOI10.1080/00949658208810560zbMath0482.65080OpenAlexW2089783325MaRDI QIDQ3940795

William J. Welch

Publication date: 1982

Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00949658208810560




Related Items

Generalized maximum-entropy samplingOptimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithmCluster analysis and mathematical programmingA polynomial case of the cardinality-constrained quadratic optimization problemAn algorithm based on semidefinite programming for finding minimax optimal designsA Nonconvex Optimization Approach to IMRT Planning with Dose–Volume ConstraintsThe weighted sum of split and diameter clusteringA Local Search Framework for Experimental Design\( \mathcal{G} \)-LIME: statistical learning for local interpretations of deep neural networks using global priorsAdaptive grid semidefinite programming for finding optimal designsMultidimensional sum-up rounding for integer programming in optimal experimental designEfficient algorithms for divisive hierarchical clustering with the diameter criterionNear-optimal discrete optimization for experimental design: a regret minimization approachA greedy feature selection algorithm for big data of high dimensionalityComplexity of penalized likelihood estimationGenetic clustering algorithms.A whale optimization algorithm (WOA) approach for clusteringMinimum sum of diameters clusteringSubset Selection in Sparse MatricesApproximation Algorithms for D-optimal DesignEfficient computational algorithms for approximate optimal designsA branch-and-bound algorithm for the exact optimal experimental design problemGeneration of collocation points in the method of fundamental solutions for 2D Laplace's equationOWA fuzzy regressionSet partition by globally optimized cluster seed points



Cites Work