[HTML][HTML] Improved heuristics for solving large-scale Scanning Transmission Electron Microscopy image segmentation using the ordered median problem
JM Muñoz-Ocaña, J Puerto… - Computers & Operations …, 2024 - Elsevier
The discrete ordered median problem can be applied in a wide variety of areas. The
application of this problem in electron tomography image segmentation is currently being …
application of this problem in electron tomography image segmentation is currently being …
[HTML][HTML] Segmentation of scanning-transmission electron microscopy images using the ordered median problem
This paper presents new models for segmentation of 2D and 3D Scanning-Transmission
Electron Microscope images based on the ordered median function. The main advantage of …
Electron Microscope images based on the ordered median function. The main advantage of …
[HTML][HTML] A branch-and-price approach for the continuous multifacility monotone ordered median problem
In this paper, we address the Continuous Multifacility Monotone Ordered Median Problem.
The goal of this problem is to locate p facilities in R d minimizing a monotone ordered …
The goal of this problem is to locate p facilities in R d minimizing a monotone ordered …
A branch-and-price procedure for clustering data that are graph connected
This paper studies the Graph-Connected Clique-Partitioning Problem (GCCP), a clustering
optimization model in which units are characterized by both individual and relational data …
optimization model in which units are characterized by both individual and relational data …
A fresh view on the discrete ordered median problem based on partial monotonicity
This paper presents new results for the Discrete Ordered Median Problem (DOMP). It
exploits properties of k-sum optimization to derive specific formulations for the monotone …
exploits properties of k-sum optimization to derive specific formulations for the monotone …
[HTML][HTML] The Cooperative Maximal Covering Location Problem with ordered partial attractions
Abstract The Maximal Covering Location Problem (MCLP) is a classical location problem
where a company maximizes the demand covered by placing a given number of facilities …
where a company maximizes the demand covered by placing a given number of facilities …
[HTML][HTML] Benders decomposition for the discrete ordered median problem
Ordered median optimization has been proven to be a powerful tool to generalize many well-
known problems from the literature. In Location Theory, the Discrete Ordered Median …
known problems from the literature. In Location Theory, the Discrete Ordered Median …
A comparative study of different formulations for the capacitated discrete ordered median problem
This paper deals with the capacitated version of discrete ordered median problems. We
present different formulations considering three-index variables or covering variables to …
present different formulations considering three-index variables or covering variables to …
[HTML][HTML] Mixed-integer linear programming formulations and column generation algorithms for the Minimum Normalized Cuts problem on networks
This paper deals with the k-way normalized cut problem in complex networks. It presents a
methodology that uses mathematical optimization to provide mixed-integer linear …
methodology that uses mathematical optimization to provide mixed-integer linear …
[HTML][HTML] Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem
We revisit a formulation for the simple plant facility location and p-median problems
introduced by Cornuéjols, Nemhauser and Wolsey (1980). Despite being the smallest …
introduced by Cornuéjols, Nemhauser and Wolsey (1980). Despite being the smallest …