An improved algorithm for the minmax regret path centdian problem on trees

DOI10.1016/J.JCSS.2018.05.003zbMATH Open1409.90214OpenAlexW2810587429WikidataQ129602754 ScholiaQ129602754MaRDI QIDQ1672003FDOQ1672003

Jhih-Hong Ye, Chih-Yu Li, Biing-Feng Wang

Publication date: 7 September 2018

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2018.05.003

Recommendations

• An improved algorithm for the minmax regret path center problem on trees
• On the minmax regret path center problem on trees
• On the minmax regret path median problem on trees
• An improved algorithm for the minmax regret median problem on a tree
• Improved Algorithms for the Minmax-Regret 1-Center Problem

zbMATH Keywords

treescenterslocation theorymediansminmax regret optimizationcentdians

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47)

Cites Work

• Robust discrete optimization and its applications
• Location Theory
• Minimax regret p-center location on a network with demand uncertainty
• Minmax-regret robust 1-median location on a tree
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Algorithms for the robust 1-center problem on a tree
• Facility location problems with uncertainty on the plane
• Minimax regret single-facility ordered median location problems on networks
• Minmax Regret Median Location on a Network Under Uncertainty
• An improved algorithm for the minmax regret median problem on a tree
• Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
• Improved algorithms for the minmax-regret 1-center and 1-median problems
• A note on the minmax regret centdian location on trees
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• A note on the robust 1-center problem on trees
• 'Multidimensional' extensions and a nested dual approach for the m-median problem
• Complexity of robust single facility location problems on networks with uncertain edge lengths.
• The optimal location of a path or tree in a tree network
• Optimum Locations on a Graph with Probabilistic Demands
• A linear algorithm for a core of a tree
• On the minmax regret path median problem on trees
• An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
• Minimax regret path location on trees
• Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
• On locating path- or tree-shaped facilities on networks
• Sensitivity analysis of the optimal location of a facility
• Algorithms for path medi-centers of a tree
• The bi‐criteria doubly weighted center‐median path problem on a tree
• Title not available (Why is that?)
• Algorithms for central-median paths with bounded length on trees
• Sensitivity Analysis in Minisum Facility Location Problems

Cited In (5)

• Efficient algorithms for the minmax regret path center problem with length constraint on trees
• An improved algorithm for the minmax regret path center problem on trees
• A note on the minmax regret centdian location on trees
• Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks

This page was built for publication: An improved algorithm for the minmax regret path centdian problem on trees

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