The capacitated mobile facility location problem
From MaRDI portal
Publication:1737488
Recommendations
- Local search heuristics for the mobile facility location problem
- Minimizing movement in mobile facility location problems
- An effective heuristic for large-scale capacitated facility location problems
- Local-search based approximation algorithms for mobile facility location problems (extended abstract)
- Mobile facility location: combinatorial filtering via weighted occupancy
Cites work
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- A branch-and-price algorithm for the capacitated facility location problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- A column generation approach to capacitated \(p\)-median problems
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- A heuristic for BILP problems: the single source capacitated facility location problem
- A survey of algorithms for the generalized assignment problem
- An LP-based heuristic for two-stage capacitated facility location problems
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
- An exact algorithm for the capacitated facility location problems with single sourcing
- An exact method for the two-echelon, single-source, capacitated facility location problem
- 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
- Dynamic-demand capacitated facility location problems with and without relocation
- Euclidean movement minimization
- Exactly solving a two-level location problem with modular node capacities
- Local search heuristics for the mobile facility location problem
- Local-search based approximation algorithms for mobile facility location problems (extended abstract)
- Location of preventive health care facilities
- Matheuristics for the capacitated p-Median problem
- Minimizing movement
- Minimizing movement in mobile facility location problems
- Mobile facility location: combinatorial filtering via weighted occupancy
- Multicriteria tour planning for mobile healthcare facilities in a developing country
- Upper and lower bounds for the single source capacitated location problem.
Cited in
(9)- Relief aid provision to en route refugees: multi-period mobile facility location with mobile demand
- Minimizing movement in mobile facility location problems
- Dynamic location of modular manufacturing facilities with relocation of individual modules
- On the impact of resource relocation in facing health emergencies
- A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation
- Local search heuristics for the mobile facility location problem
- The multi-period \(p\)-center problem with time-dependent travel times
- Mobile facility location: combinatorial filtering via weighted occupancy
- The median routing problem for simultaneous planning of emergency response and non-emergency jobs
This page was built for publication: The capacitated mobile facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1737488)
