Segmentation of scanning-transmission electron microscopy images using the ordered median problem
From MaRDI portal
Publication:2672089
DOI10.1016/J.EJOR.2022.01.022OpenAlexW4205781593MaRDI QIDQ2672089FDOQ2672089
Authors: José J. Calvino, Miguel López-Haro, Juan M. Muñoz-Ocaña, Justo Puerto, Antonio M. Rodríguez-Chía
Publication date: 8 June 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.01.022
Recommendations
Cites Work
- A mixed integer linear model for clustering with variable selection
- Cluster analysis and mathematical programming
- Location theory. A unified approach
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- A flexible model and efficient solution strategies for discrete location problems
- Exact procedures for solving the discrete ordered median problem
- Multifacility ordered median problems on networks: A further analysis
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- Minimizing the sum of the \(k\) largest functions in linear time.
- Mathematical Programming for Data Mining: Formulations and Challenges
- A new formulation of the capacitated discrete ordered median problems with \(\{0,1\}\)-assignment
- Clustering data that are graph connected
- A mixed-integer programming approach to the clustering problem with an application in customer segmentation
- Distribution systems design with role dependent objectives
- A fresh view on the discrete ordered median problem based on partial monotonicity
- Ordered \(p\)-median problems with neighbourhoods
- A revised variable neighborhood search for the discrete ordered median problem
- A comparative study of different formulations for the capacitated discrete ordered median problem
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- A branch-and-price procedure for clustering data that are graph connected
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- Directional sinogram inpainting for limited angle tomography
Cited In (4)
- Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks
- Constraint relaxation for the discrete ordered median problem
- A branch-and-price approach for the continuous multifacility monotone ordered median problem
- Improved heuristics for solving large-scale scanning transmission electron microscopy image segmentation using the ordered median problem
Uses Software
This page was built for publication: Segmentation of scanning-transmission electron microscopy images using the ordered median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672089)