Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction
type: Item
instance of: scholarly article
title: Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction
zbMATH Open document ID: 1251.90393
author: Chun-An Chou
author: Tanya Y. Berger-Wolf
author: Mary V. Ashley
author: Wanpracha A. Chaovalitwongse
author: Bhaskar Dasgupta
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 92B15
Mathematics Subject Classification ID: 62H30
zbMATH DE Number: 6107492
zbMATH Keywords: clustering analysis
zbMATH Keywords: capacitated clustering problem
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: sibling reconstruction
zbMATH Keywords: computational biology
MaRDI profile type: Publication
full work available at URL: j.cor.2011.04.017
OpenAlex ID: W2113289980
cites work: Cluster analysis and mathematical programming
cites work: A graphical approach to relatedness inference
cites work: A simulated annealing algorithm for maximum likelihood pedigree reconstruction
cites work: Set covering approach for reconstruction of sibling relationships
cites work: New optimization model and algorithm for sibling reconstruction from genetic markers
cites work: Greedy randomized adaptive search procedures
cites work: Solving capacitated clustering problems
cites work: Cliques and clustering: A combinatorial approach
cites work: A new method for solving capacitated location problems based on a set partitioning approach
cites work: A column generation approach to capacitated \(p\)-median problems
cites work: A computational evaluation of a general branch-and-price framework for capacitated network location problems
cites work: Capacitated clustering problems by hybrid simulated annealing and tabu search
cites work: A bionomic approach to the capacitated \(p\)-median problem
cites work: Clustering search algorithm for the capacitated centered clustering problem
cites work: Greedy random adaptive memory programming search for the capacitated clustering problem
cites work: Density based problem space search for the capacitated clustering \(p\)-median problem
cites work: The capacitated centred clustering problem
cites work: An effective heuristic for large-scale capacitated facility location problems
cites work: The noising method: A new method for combinatorial optimization
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Partition-distance: A problem and class of perfect graphs arising in clustering
DOI: 10.1016/J.COR.2011.04.017
Recommended article: Haplotyping Problem, A Clustering Approach
Recommended article: New optimization model and algorithm for sibling reconstruction from genetic markers
Recommended article: On the scalability of biocomputing algorithms: the case of the maximum clique problem
Recommended article: Clique-detection models in computational biochemistry and genomics
Recommended article: Q4662098
Recommended article: Clustering and classification problems in genetics through U-statistics
Recommended article: A Generalized Clustering Problem, with Application to DNA Microarrays
description: scientific article; zbMATH DE number 6107492