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 …

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 …

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 …

In this paper we propose a novel methodology to construct Optimal Classification Trees that
takes into account that noisy labels may occur in the training sample. The motivation of this …

Abstract The Connected Max-k-Cut Problem is an extension of the well-known Max-Cut
Problem. The objective is to partition a graph into k connected subgraphs by maximizing the …

We consider a variant of the clustering problem for a complete weighted graph. The aim is to
partition the nodes into clusters maximizing the sum of the edge weights within the clusters …

We address the problem of clustering a set of points in R d with axis-parallel clusters, while
allowing to discard a pre-specified number of points, thus declared to be outliers. We …

Anticipating the strategies of potential attackers is crucial for protecting critical infrastructure.
We can represent the challenge of the defenders of such infrastructure as a Stackelberg …

In this paper, we develop a semidefinite relaxation-based branch-and-bound algorithm that
exploits the chordal sparsity patterns of the max-cut problem. We first study how the chordal …

This article deals with the problem of partitioning a graph into pp connected components by
optimizing some balancing objective functions related to the vertex weights. Objective …