Sensitivity Analysis in Minisum Facility Location Problems
From MaRDI portal
Recommendations
Cited in
(20)- Algorithms for the robust 1-center problem on a tree
- Minmax regret solutions for minimax optimization problems with uncertainty
- An improved algorithm for the minmax regret path centdian problem on trees
- Strategic facility location: A review
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
- Sensitivity analysis to the value of \(p\) of the \({\ell}_p\) distance Weber problem
- 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
- Heuristic approaches for solid transportation-\(p\)-facility location problem
- On the minmax regret path median problem on trees
- Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients
- Sensitivity analysis for symmetric 2-peripatetic salesman problems
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- Robust location problems with pos/neg weights on a tree
- Tolerance analysis in linear systems and linear programming
- Tradeoff analysis of cost and aggregation error for some location models
- Sensitivity analysis of the optimal location of a facility
- scientific article; zbMATH DE number 1189255 (Why is no real title available?)
- scientific article; zbMATH DE number 1264479 (Why is no real title available?)
- scientific article; zbMATH DE number 1417899 (Why is no real title available?)
This page was built for publication: Sensitivity Analysis in Minisum Facility Location Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4006339)