A note on the robust 1-center problem on trees
type: Item
instance of: scholarly article
title: A note on the robust 1-center problem on trees
zbMATH Open document ID: 1013.90075
DOI: 10.1023/A:1020711416254
author: Helidon Dollani
author: Rainer E. Burkard
published in: Annals of Operations Research
publication date: 2003-05-04T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1904006
zbMATH Keywords: location problems
zbMATH Keywords: robust optimization
zbMATH Keywords: center problem
MaRDI profile type: Publication
Recommended article: Algorithms for the robust 1-center problem on a tree
Recommended article: New approaches to the robust 1-center location problems on tree networks
Recommended article: The $p$-Center Problem in Tree Networks Revisited
Recommended article: Further Study on Reverse 1-Center Problem on Trees
Recommended article: AN ADJUSTABLE ROBUST APPROACH FOR A 1-MEDIAN LOCATION PROBLEM ON A TREE
Recommended article: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
Recommended article: Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
Recommended article: Upgrading the 1-center problem with edge length variables on a tree
Recommended article: The Round-Trip p-Center and Covering Problem on a Tree
Recommended article: The weighted \(k\)-center problem in trees for fixed \(k\)
description: scientific article; zbMATH DE number 1904006