The multi-period \(p\)-center problem with time-dependent travel times
From MaRDI portal
Publication:2669591
DOI10.1016/j.cor.2021.105487OpenAlexW3192199233MaRDI QIDQ2669591
Emanuela Guerriero, Emanuele Manni, Tobia Calogiuri, Gianpaolo Ghiani
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.10300
Cites Work
- Unnamed Item
- Unnamed Item
- Double bound method for solving the \(p\)-center location problem
- Multiperiod location-routing with decoupled time scales
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- Ambulance location and relocation problems with time-dependent travel times
- On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
- A new formulation for the conditional \(p\)-median and \(p\)-center problems
- A scalable exact algorithm for the vertex \(p\)-center problem
- The capacitated mobile facility location problem
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- Vehicle dispatching with time-dependent travel times
- Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles
- The stratified \(p\)-center problem
- Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
- A multiperiod set covering location model for dynamic redeployment of ambulances
- Time-dependent MEXCLP with start-up and relocation cost
- Mathematical Models and Search Algorithms for the Capacitated p-Center Problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Locating mobile servers on a network with markovian properties
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Discrete Center Problems
- The m-Center Problem
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: The multi-period \(p\)-center problem with time-dependent travel times
