activity
20082024
most citedMulti-period stochastic covering location problems: Modeling framework and solution approach

32 citations · 53 across the 3 of their papers we have counts for

collaborators
Showing math.OCShow all

5 papers · 1 filter

math.OC2024★ 21 cited

Upgrading edges in the maximal covering location problem

Marta Baldomero-Naranjo, Jörg Kalcsics, Alfredo Marín +1

We study the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem aims at locating p facilities on the vertices (of t…

math.OC2024★ 32 cited

Multi-period stochastic covering location problems: Modeling framework and solution approach

Alfredo Marín, Luisa I. Martínez-Merino, Antonio M. Rodríguez-Chía +1

This paper introduces a very general discrete covering location model that accounts for uncertainty and time-dependent aspects. A MILP formulation is proposed for the problem. Afte…

math.OC2021

The soft-margin Support Vector Machine with ordered weighted average

Alfredo Marín, Luisa I. Martínez-Merino, Justo Puerto +1

This paper deals with an extension of the Support Vector Machine (SVM) for classification problems where, in addition to maximize the margin, i.e., the width of strip defined by th…

math.OC2018

Upgrading nodes in tree-shaped hub location

Víctor Blanco, Alfredo Marín

In this paper, we introduce the Tree of Hubs Location Problem with Upgrading, a mixture of the Tree of Hubs Location Problem, presented by Contreras et. al (2010), and the Minimum…

math.OC2008

A comparison of formulations and solution methods for the Minimum-Envy Location Problem. Additional results

Inmaculada Espejo, Alfredo Marin, Justo Puerto +1

We consider a discrete facility location problem with a new form of equity criterion. The model discussed in the paper analyzes the case where demand points only have strict prefer…