Minmax regret maximal covering location problems with edge demands
From MaRDI portal
Publication:2668649
DOI10.1016/j.cor.2020.105181OpenAlexW3110804556MaRDI QIDQ2668649
Jörg Kalcsics, Marta Baldomero-Naranjo, Antonio M. Rodríguez-Chía
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105181
Related Items (4)
Upgrading edges in the maximal covering location problem ⋮ Solving the 1-median problem on a network with continuous demand and demand surplus ⋮ Multi-type maximal covering location problems: hybridizing discrete and continuous problems ⋮ Distributionally robust Weber problem with uncertain demand
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On covering location problems on networks with edge demand
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights
- Efficient and exact manipulation of algebraic points and curves
- A minmax regret version of the time-dependent shortest path problem
- The ordered gradual covering location problem on a network
- Generalized coverage: new developments in covering location models
- Robust discrete optimization and its applications
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Formulation and algorithms for the robust maximal covering location problem
- Multi-period stochastic covering location problems: modeling framework and solution approach
- Interval data minmax regret network optimization problems
- Algorithmic results for ordered median problems
- Covering models and optimization techniques for emergency response facility location and planning: a review
- On the fuzzy maximal covering location problem
- Minimax Regret Single-Facility Ordered Median Location Problems on Networks
- Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
- Minmax Regret Median Location on a Network Under Uncertainty
- Multifacility ordered median problems on networks: A further analysis
- Robust mean absolute deviation problems on networks with linear vertex weights
- The Theory of Statistical Decision
- On the complexity of a class of combinatorial optimization problems with uncertainty
- The generalized maximal covering location problem
- Covering edges in networks
This page was built for publication: Minmax regret maximal covering location problems with edge demands
