A fractional model for locating semi-desirable facilities on networks
From MaRDI portal
Publication:5955092
DOI10.1016/S0377-2217(01)00030-3zbMath1048.90131MaRDI QIDQ5955092
Eduardo Conde, Emilio Carrizosa
Publication date: 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (7)
Minmax regret location--allocation problem on a network under uncertainty ⋮ A bi-objective modeling approach applied to an urban semi-desirable facility location problem ⋮ Locating a semi-obnoxious covering facility with repelling polygonal regions ⋮ A branch-and-cut method for the obnoxious \(p\)-median problem ⋮ A computational study of a nonlinear minsum facility location problem ⋮ Deriving weights in multiple-criteria decision making with support vector machines ⋮ A sixth bibliography of fractional programming
Cites Work
- A destination optimality in asymmetric distance Fermat-Weber problems
- Geometrical properties of the Fermat-Weber problem
- A correction to the definition of local center
- Locating an undesirable facility with a minimax criterion
- Best piecewise constant approximation of a function of single variable
- Analytical models for locating undesirable facilities
- Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization
- Generalized concavity
- The convergence rate of the sandwich algorithm for approximating convex functions
- Semi-obnoxious location models: A global optimization approach
- The Weber Problem On The Plane With Some Negative Weights
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- Finite Dominating Sets for Network Location Problems
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- Locating an obnoxious facility on a euclidean network to minimize neighborhood damage
- A Long-range Selection and Timing Analysis System for Facility Location: Theory
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A fractional model for locating semi-desirable facilities on networks