The capacitated mobile facility location problem
From MaRDI portal
Publication:1737488
DOI10.1016/j.ejor.2019.02.055zbMath1430.90384OpenAlexW2920930353MaRDI QIDQ1737488
Publication date: 23 April 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://cdm21054.contentdm.oclc.org/cdm/ref/collection/IR/id/9550
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (5)
Relief aid provision to en route refugees: multi-period mobile facility location with mobile demand ⋮ The multi-period \(p\)-center problem with time-dependent travel times ⋮ The median routing problem for simultaneous planning of emergency response and non-emergency jobs ⋮ A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation ⋮ On the impact of resource relocation in facing health emergencies
Cites Work
- Unnamed Item
- A heuristic for BILP problems: the single source capacitated facility location problem
- Euclidean movement minimization
- Local search heuristics for the mobile facility location problem
- Multicriteria tour planning for mobile healthcare facilities in a developing country
- A branch-and-price algorithm for the capacitated facility location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- A survey of algorithms for the generalized assignment problem
- Upper and lower bounds for the single source capacitated location problem.
- A column generation approach to capacitated \(p\)-median problems
- An exact method for the two-echelon, single-source, capacitated facility location problem
- Location of preventive health care facilities
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Mobile facility location: combinatorial filtering via weighted occupancy
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
- Combining very large scale and ILP based neighborhoods for a two-level location problem
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Exactly solving a two-level location problem with modular node capacities
- Minimizing movement
- Dynamic-demand capacitated facility location problems with and without relocation
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- An LP-based heuristic for two-stage capacitated facility location problems
- Minimizing movement in mobile facility location problems
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- Matheuristics for the capacitated p‐median problem
- Local-Search based Approximation Algorithms for Mobile Facility Location Problems: (Extended Abstract)
This page was built for publication: The capacitated mobile facility location problem
