Solving the 1-median problem on a network with continuous demand and demand surplus
From MaRDI portal
Publication:6068730
DOI10.1016/j.cor.2023.106399MaRDI QIDQ6068730
Rafael Blanquero, Boglárka G.-Tóth, Emilio Carrizosa, Kristóf Kovács
Publication date: 13 November 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On covering location problems on networks with edge demand
- On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
- Continuous location problems and big triangle small triangle: Constructing better bounds
- Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
- Undesirable facility location with minimal covering objectives
- DC programming: overview.
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- Solving the median problem with continuous demand on a network
- Minmax regret maximal covering location problems with edge demands
- Network Median Problems with Continuously Distributed Demand
- The Variance Location Problem on a Network with Continuously distributed demand
This page was built for publication: Solving the 1-median problem on a network with continuous demand and demand surplus