A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
From MaRDI portal
(Redirected from Publication:4096733)
Cited in
(17)- A comparison of two dual-based procedures for solving the p-median problem
- Dynamic versions of set covering type public facility location problems
- The maximum-capture hierarchical location problem
- Cournot-Stackelberg games in competitive delocation
- A gamma heuristic for the \(p\)-median problem
- An alternating heuristic for medianoid and centroid problems in the plane
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- Load balancing and capacity constraints in a hierarchical location model
- Practical aspects associated with location planning for maternal and perinatal assistance in Brazil
- A column generation approach for the maximal covering location problem
- Hierarchical location-allocation models for congested systems
- On the use of genetic algorithms to solve location problems
- Analyses of location-price game on networks with stochastic customer behavior and its heuristic algorithm
- On the quickest evacuation location problem in humanitarian operations: multi-objective modelling and matheuristic solution
- Efficient primal-dual heuristic for a dynamic location problem
- Incorporating waiting time in competitive location models
- On a class of subadditive duals for the uncapacitated facility location problem
This page was built for publication: A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4096733)