Advanced network connectivity features and zonal requirements in covering location problems
From MaRDI portal
Publication:6047840
DOI10.1016/j.cor.2023.106307OpenAlexW4381325752MaRDI QIDQ6047840
Serena Fugaro, Antonino Sgalambro
Publication date: 13 September 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106307
Cites Work
- Looking for edge-equitable spanning trees
- The zone-constrained location problem on a network
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Analyzing tradeoffs between zonal constraints and accessibility in facility location
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Median and covering location problems with interconnected facilities
- Balancing minimum spanning trees and shortest-path trees
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Performance indicators in multiobjective optimization
- Continuous maximal covering location problems with interconnected facilities
- Minimizing movement
- The Maximum Coverage Location Problem
- Capacitated service and regional constraints in location-allocation modeling
- A robust sensor covering and communication problem
- Location Science
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Unnamed Item
This page was built for publication: Advanced network connectivity features and zonal requirements in covering location problems
