Minmax regret location–allocation problem on a network under uncertainty

This publication has 20 references indexed in Scilit:

• An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion
  Mathematical Programming, 2004
• An improved algorithm for the minmax regret median problem on a tree
  Networks, 2003
• A Note on the Robust 1-Center Problem on Trees
  Annals of Operations Research, 2002
• A fractional model for locating semi-desirable facilities on networks
  European Journal of Operational Research, 2002
• On the complexity of a class of combinatorial optimization problems with uncertainty
  Mathematical Programming, 2001
• Solving Nonconvex Planar Location Problems by Finite Dominating Sets
  Journal of Global Optimization, 2000
• Algorithms for the robust 1-center problem on a tree
  European Journal of Operational Research, 2000
• Minmax Regret Median Location on a Network Under Uncertainty
  INFORMS Journal on Computing, 2000
• Minmax-regret robust 1-median location on a tree
  Networks, 1998
• Geometrical properties of the Fermat-Weber problem
  European Journal of Operational Research, 1985