Sensitivity Analysis in Minisum Facility Location Problems

DOI10.1287/opre.39.6.961zbMath0748.90037OpenAlexW2094399932MaRDI QIDQ4006339

Martine Labbé, Jacques-François Thisse, Richard E. Wendell

Publication date: 26 September 1992

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.39.6.961

zbMATH Keywords

tree networkdegree of optimalityfinite set of feasible pointsperturbations of the weightssingle facility, minisum location problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Continuous location (90B85) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (13)

Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients ⋮ Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ Unnamed Item ⋮ An improved algorithm for the minmax regret path centdian problem on trees ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ Heuristic approaches for solid transportation-\(p\)-facility location problem ⋮ Robust location problems with pos/neg weights on a tree ⋮ Strategic facility location: A review ⋮ Complexity of robust single facility location problems on networks with uncertain edge lengths. ⋮ Tolerance analysis in linear systems and linear programming ⋮ Algorithms for the robust 1-center problem on a tree ⋮ Minmax regret solutions for minimax optimization problems with uncertainty ⋮ On the minmax regret path median problem on trees

This page was built for publication: Sensitivity Analysis in Minisum Facility Location Problems