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

DOI10.1016/J.EJOR.2017.03.043MaRDI QIDQ1683071zbMATH OpenOpenAlexFDO

Authors Luisa I. Martínez-Merino, Maria Albareda-Sambola, Antonio M. Rodríguez-Chía

Publication date 6 December 2017

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2017.03.043

zbMATH Keywords

\(p\)-centerdemand uncertaintydiscrete locationmixed integer linear formulations

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Mixed integer programming (90C11)

Recommendations

• The stochastic p-hub center problem with service-level constraints
• The \(p\)-center problem under locational uncertainty of demand points
• Locating Discretionary Service Facilities Based on Probabilistic Customer Flows
• Solving a bicriteria problem of optimal service centers location
• Locating service centers with precedence constraints
• Multi-Agent Customer Allocation in a Stochastic Service System
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
• Location-allocation of multiple-server service centers with constrained queues or waiting times
• The multi-service center problem

Cites work

• A flexible model and efficient solution strategies for discrete location problems
• A modified variable neighborhood search for the discrete ordered median problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Capacitated p-center problem with failure foresight
• Closest assignment constraints in discrete location problems
• Double bound method for solving the p-center location problem
• Facility location for large-scale emergencies
• Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• Heuristic procedures for solving the discrete ordered median problem
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• Location science
• On cent-dians of general networks
• Probability chains: a general linearization technique for modeling reliability in facility location and related problems
• Robust discrete optimization and its applications
• Robust Positioning of Service Units
• Robust vertex p-center model for locating urgent relief distribution centers
• Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
• Stochastic analysis in location research
• Variable neighborhood search

Cited in

(9)

• A scalable exact algorithm for the vertex \(p\)-center problem
• GRASP and VNS for solving the \(p\)-next center problem
• The stratified p-center problem
• Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
• Constraint relaxation for the discrete ordered median problem
• Dynamically second-preferred p-center problem
• A parallel variable neighborhood search for -neighbor facility location problems
• Approximating the probabilistic p-center problem under pressure
• Exact methods and a variable neighborhood search for the robust capacitated p-median problem

Describes a project that uses

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

This page was built for publication: The probabilistic \(p\)-center problem: planning service for potential customers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683071)