The stratified \(p\)-center problem (Q2003436)

From MaRDI portal

Revision as of 19:24, 19 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The stratified \(p\)-center problem	scientific article

Statements

scholarly article

0 references

The stratified \(p\)-center problem (English)

0 references

Maria Albareda-Sambola

0 references

Luisa I. Martínez-Merino

0 references

Antonio M. Rodríguez-Chía

0 references

Computers \& Operations Research

0 references

publication date

8 July 2019

0 references

full work available at URL

https://arxiv.org/abs/1808.01307

0 references

zbMATH Keywords

location

0 references

\(p\)-center

0 references

discrete optimization

0 references

sample average approximation

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Lagrangean duals and exact solution to the capacitated \(p\)-center problem

0 references

Minimax regret p-center location on a network with demand uncertainty

0 references

Integer Programming: Methods, Uses, Computations

0 references

Double bound method for solving the \(p\)-center location problem

0 references

Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane

0 references

Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem

0 references

A scalable exact algorithm for the vertex \(p\)-center problem

0 references

0 references

Competitive Location on a Network

0 references

Conditional <i>p</i>-Center Problems

0 references

A New Formulation and Resolution Method for the p-Center Problem

0 references

An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem

0 references

Closest assignment constraints in discrete location problems

0 references

Capacitated \(p\)-center problem with failure foresight

0 references

Solving Large <i>p</i>-Median Problems with a Radius Formulation

0 references

The <i>m</i>-Center Problem: Minimax Facility Location

0 references

Algorithms for finding P-centers on a weighted tree (for relatively small P)

0 references

An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers

0 references

The Sample Average Approximation Method for Stochastic Discrete Optimization

0 references

The empirical behavior of sampling methods for stochastic programming

0 references

Robust vertex \(p\)-center model for locating urgent relief distribution centers

0 references

A flexible model and efficient solution strategies for discrete location problems

0 references

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

0 references

An exact algorithm for the capacitated vertex \(p\)-center problem

0 references

Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent

0 references

The maximum reliability location problem and \(\alpha\)-reliable p-center problem: Derivatives of the probabilistic location set covering problem

0 references

Analysis of Sample-Path Optimization

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.cor.2019.04.013

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2003436

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2003436&oldid=36506943"