Cover Image

The probabilistic p-center problem: Planning service for potential customers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Martínez-Merino, Luisa I., Albareda-Sambola, Maria, Rodríguez-Chía, Antonio M.
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Coordinating Drop-Off Locations and Pickup Routes: A Budget-Constrained Routing Perspective
by: Albareda-Sambola, Maria, et al.
Published: (2025)

Multi-product maximal covering second-level facility location problem
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

A robust SVM-based approach with feature selection and outliers detection for classification problems
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

The profit-oriented hub line location problem with elastic demand
by: Cobeña, Brenda, et al.
Published: (2024)

Multi-period stochastic covering location problems: Modeling framework and solution approach
by: Marín, Alfredo, et al.
Published: (2024)

Tightening big Ms in integer programming formulations for support vector machines with ramp loss
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

Constraint relaxation for the Discrete Ordered Median Problem
by: Martínez-Merino, Luisa I., et al.
Published: (2024)

Edge downgrades in the maximal covering location problem
by: Baldomero-Naranjo, Marta, et al.
Published: (2025)

Minmax regret maximal covering location problems with edge demands
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

Upgrading edges in the maximal covering location problem
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

Benders decomposition for the large-scale probabilistic set covering problem
by: Liang, Jie, et al.
Published: (2025)

Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric
by: Seyedi, Iman, et al.
Published: (2025)

A stochastic optimization algorithm for revenue maximization in a service system with balking customers
by: Bodas, Shreehari Anand, et al.
Published: (2025)

A hybrid metaheuristic to optimize electric first-mile feeder services with charging synchronization constraints and customer rejections
by: Ma, Tai-Yu, et al.
Published: (2024)

A 140 line MATLAB code for topology optimization problems with probabilistic parameters
by: Uihlein, Andrian, et al.
Published: (2025)

Towards large-scale probabilistic set covering problems: an efficient Benders decomposition approach
by: Lv, Wei, et al.
Published: (2024)

On the complexity of the upgrading version of the maximal covering location problem
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

A rounding and clustering-based exact algorithm for the p-center problem
by: Ales, Zacharie, et al.
Published: (2024)

Queue or lounge: strategic design for strategic customer
by: Sultana, Riya, et al.
Published: (2025)

Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives
by: Brandstetter, Christof, et al.
Published: (2024)

Proceedings of the XIII International Workshop on Locational Analysis and Related Problems
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

An efficient branch-and-cut algorithm for the multiple probabilistic covering location problem
by: Wang, Yan-Ru, et al.
Published: (2025)

A graph-based approach to customer segmentation using the RFM model
by: Filho, André Luiz Corrêa Vianna, et al.
Published: (2025)

A novel dual-stage algorithm for capacitated arc routing problems with time-dependent service costs
by: Li, Qingya, et al.
Published: (2024)

An optimal control problem for Stokes-Cahn-Hilliard-Oono equations with regular potential
by: Kundu, Arghya
Published: (2026)

A Mathematical Optimization Approach to Multisphere Support Vector Data Description
by: Blanco, Víctor, et al.
Published: (2025)

Chebyshev centers and radii for sets induced by quadratic matrix inequalities
by: Shakouri, Amir, et al.
Published: (2024)

Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints
by: Locatelli, Marco, et al.
Published: (2022)

Optimal probabilistic feature shifts for reclassification in tree ensembles
by: Blanco, Víctor, et al.
Published: (2024)

Degree reduction techniques for polynomial optimization problems
by: González-Rodríguez, Brais, et al.
Published: (2024)

Some properties of sets, functions, and multi-objective optimization problems using p-convexity
by: Vera, Cristian
Published: (2026)

Cost allocation problems on highways with grouped users
by: Gómez-Rodríguez, Marcos, et al.
Published: (2023)

On an optimization model for firefighting helicopter planning
by: Barreiro, Marta Rodríguez, et al.
Published: (2024)

Notes on the discretization of TV-norm regularized inverse potential problems
by: Baratchart, L, et al.
Published: (2025)

Some obstacle problems for partially hinged plates and related optimization issues
by: Berchio, Elvise, et al.
Published: (2025)

On quasi-convex smooth optimization problems by a comparison oracle
by: Gasnikov, A. V., et al.
Published: (2024)

On a probabilistic global optimizer derived from the Walker slice sampling
by: Gupta, Aditya, et al.
Published: (2024)

Discrete fully probabilistic design: towards a control pipeline for the synthesis of policies from examples
by: Ferrentino, Enrico, et al.
Published: (2021)

Exact solution approaches for the discrete $α$-neighbor $p$-center problem
by: Gaar, Elisabeth, et al.
Published: (2022)

The one-station bike repositioning problem
by: Angelelli, E., et al.
Published: (2022)