Optimized assignment patterns in mobile edge cloud networks
From MaRDI portal
Publication:1734851
DOI10.1016/J.COR.2018.02.022zbMath1458.90189OpenAlexW2791240668WikidataQ130185644 ScholiaQ130185644MaRDI QIDQ1734851
Alberto Ceselli, Stefano Secci, Marco Fiore, Marco Premoli
Publication date: 27 March 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.02.022
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- Local search heuristics for the mobile facility location problem
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP)
- Flexible cell selection in cellular networks
- Multi-period capacitated location with modular equipments
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
- The Generalized Assignment Problem and Extensions
This page was built for publication: Optimized assignment patterns in mobile edge cloud networks