Upgrading edges in the maximal covering location problem
From MaRDI portal
Publication:2673553
DOI10.1016/j.ejor.2022.02.001OpenAlexW4210801032MaRDI QIDQ2673553
Marta Baldomero-Naranjo, Jörg Kalcsics, Alfredo Marín, Antonio M. Rodríguez-Chía
Publication date: 10 June 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.02.001
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (4)
Upgrading edges in the graphical TSP ⋮ The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation ⋮ Facility location problems on graphs with non-convex neighborhoods ⋮ Optimization models for cloud seeding network design and operations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- On covering location problems on networks with edge demand
- An inverse approach to convex ordered median problems in trees
- Closest assignment constraints in discrete location problems
- The inverse 1-median problem on tree networks with variable real edge lengths
- Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
- Inverse \(p\)-median problems with variable edge lengths
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights
- Upgrading \(p\)-median problem on a path
- Reverse 2-median problem on trees
- Computational experience with general cutting planes for the set covering problem
- Up- and downgrading the 1-center in a network
- Weight reduction problems with certain bottleneck objectives.
- On the flow cost lowering problem
- Upgrading nodes in tree-shaped hub location
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- Upgrading the 1-center problem with edge length variables on a tree
- Upgrading min-max spanning tree problem under various cost functions
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Multi-period stochastic covering location problems: modeling framework and solution approach
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm
- Capacitated multi-period maximal covering location problem with server uncertainty
- Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
- The minimal covering location and sizing problem in the presence of gradual cooperative coverage
- On the fuzzy maximal covering location problem
- Covering location problem of emergency service facilities in an uncertain environment
- Solving the maximal covering location problem with heuristic concentration
- Inverse median problems
- Minmax regret maximal covering location problems with edge demands
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Upgrading Shortest Paths in Networks
- Fuzzy Models and Resolution Methods for Covering Location Problems: an Annotated Bibliography
- Cooperative covering problems on networks
- Network upgrading problems
- A linear time algorithm for the reverse 1‐median problem on a cycle
- Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
- Capacitated facility location/network design problems.
- The generalized maximal covering location problem
- Covering edges in networks
This page was built for publication: Upgrading edges in the maximal covering location problem
