Robust location problems with pos/neg weights on a tree

DOI10.1002/NET.1029MaRDI QIDQ2748385zbMATH OpenOpenAlexFDO

Authors Rainer E. Burkard, Helidon Dollani

Publication date 14 October 2001

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.1029

zbMATH Keywords

location problemsmedian problemobnoxious facilitiesrobust optimization

Mathematics Subject Classification ID

Trees (05C05) Discrete location and assignment (90B80) Stochastic programming (90C15)

Recommendations

• New approaches to the robust 1-center location problems on tree networks
• A note on the robust 1-center problem on trees
• Minmax-regret robust 1-median location on a tree
• Computing minmax regret 1-median on a tree network with positive/negative vertex weights
• Algorithms for the robust 1-center problem on a tree

Cites work

• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• scientific article; zbMATH DE number 1279217 (Why is no real title available?)
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Minmax Regret Median Location on a Network Under Uncertainty
• Minmax-regret robust 1-median location on a tree
• On Parametric Medians of Trees
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Robust discrete optimization and its applications
• Sensitivity Analysis in Minisum Facility Location Problems
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems

Cited in

(13)

• Robust placement of sensors in dynamic water distribution systems
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
• Center problems with pos/neg weights on trees
• New approaches to the robust 1-center location problems on tree networks
• AN ADJUSTABLE ROBUST APPROACH FOR A 1-MEDIAN LOCATION PROBLEM ON A TREE
• Lexicographic -robustness: an application to the 1-median problem
• scientific article; zbMATH DE number 1279217 (Why is no real title available?)
• A linear time algorithm for computing minmax regret 1-median on a tree network
• Robust mean absolute deviation problems on networks with linear vertex weights
• The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
• Some robust inverse median problems on trees with interval costs
• Robust vertex centdian facility location problem on tree networks
• Discrete location problems with push-pull objectives

This page was built for publication: Robust location problems with pos/neg weights on a tree

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