Improved heuristics for solving large-scale scanning transmission electron microscopy image segmentation using the ordered median problem
From MaRDI portal
Publication:6551124
Cites work
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- A VNS approach to multi-location inventory redistribution with vehicle routing
- A kernel search heuristic for a fair facility location problem
- A mixed-integer programming approach to the clustering problem with an application in customer segmentation
- A modified variable neighborhood search for the discrete ordered median problem
- A revised variable neighborhood search for the discrete ordered median problem
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- An efficient augmented Lagrangian method with applications to total variation minimization
- Angenäherte Auflösung von Systemen linearer Gleichungen.
- Clusterability and Clustering of Images and Other “Real” High-Dimensional Data
- Compressed sensing
- GRASP and VNS for solving the \(p\)-next center problem
- Greedy randomized adaptive search procedures
- Heuristic procedures for solving the discrete ordered median problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Mathematical Programming for Data Mining: Formulations and Challenges
- Minimizing the sum of the \(k\) largest functions in linear time.
- Mixed integer linear programming for feature selection in support vector machine
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Segmentation of scanning-transmission electron microscopy images using the ordered median problem
- Variable neighborhood search
This page was built for publication: Improved heuristics for solving large-scale scanning transmission electron microscopy image segmentation using the ordered median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551124)
