Model-based capacitated clustering with posterior regularization

DOI10.1016/j.ejor.2018.04.048zbMath1403.90519OpenAlexW2803918556WikidataQ129807734 ScholiaQ129807734MaRDI QIDQ724144

Jeffrey W. Ohlmann, Feng Mai, Michael J. Fry

Publication date: 25 July 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.048

zbMATH Keywords

heuristicsexpectation-maximization algorithmGaussian mixture modelscapacitated \(p\)-median problemposterior regularization

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (5)

A matheuristic for large-scale capacitated clustering ⋮ Discrete facility location in machine learning ⋮ Dynamic community partitioning for e-commerce last mile delivery with time window constraints ⋮ Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery ⋮ Optimization problems for machine learning: a survey

Uses Software

• mclust
• BayesOpt
• Spearmint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A reactive GRASP with path relinking for capacitated clustering
• A genetic algorithm for solving a capacitated \(p\)-median problem
• Density based problem space search for the capacitated clustering \(p\)-median problem
• Solving capacitated clustering problems
• Using clustering analysis in a capacitated location-routing problem
• An optimization model for the design of a capacitated multi-product reverse logistics network with uncertainty
• An effective VNS for the capacitated \(p\)-median problem
• Choosing starting values for the EM algorithm for getting the highest likelihood in multivariate Gaussian mixture models
• Choosing initial values for the EM algorithm for finite mixtures
• Efficient algorithms for the capacitated concentrator location problem
• Stochastic vehicle routing
• A bionomic approach to the capacitated \(p\)-median problem
• An efficient genetic algorithm for the \(p\)-median problem
• Two exact algorithms for the capacitated \(p\)-median problem
• A column generation approach to capacitated \(p\)-median problems
• A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem
• Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction
• Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem
• A tabu search heuristic and adaptive memory procedure for political districting
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
• A scatter search heuristic for the capacitated clustering problem
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
• Chance-Constrained Programming
• Estimating Flight Departure Delay Distributions—A Statistical Approach With Long-Term Trend and Short-Term Pattern
• Detecting Features in Spatial Point Processes with Clutter via Model-Based Clustering
• Statistical Analysis of Spatial Point Patterns by Means of Distance Methods
• Model-Based Gaussian and Non-Gaussian Clustering
• Model-Based Clustering, Discriminant Analysis, and Density Estimation
• A branch‐and‐price algorithm for the capacitated p‐median problem
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
• Variable Selection for Model-Based Clustering
• A new method for solving capacitated location problems based on a set partitioning approach

This page was built for publication: Model-based capacitated clustering with posterior regularization