Closest assignment constraints in discrete location problems
From MaRDI portal
Publication:439609
DOI10.1016/j.ejor.2011.12.002zbMath1244.90127OpenAlexW1969109053MaRDI QIDQ439609
Alfredo Marín, Inmaculada Espejo, Antonio M. Rodríguez-Chía
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.12.002
Related Items (30)
The maximin HAZMAT routing problem ⋮ Location-allocation approaches for hospital network planning under uncertainty ⋮ Capacity management in public service facility networks: a model, computational tests and a case study ⋮ An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network ⋮ Capacitated \(p\)-center problem with failure foresight ⋮ Location of Emergency Facilities with Uncertainty in the Demands ⋮ Efficient solution of a class of location-allocation problems with stochastic demand and congestion ⋮ When centers can fail: a close second opportunity ⋮ Facility location under service level constraints for heterogeneous customers ⋮ The leader multipurpose shopping location problem ⋮ The probabilistic \(p\)-center problem: planning service for potential customers ⋮ Upgrading edges in the maximal covering location problem ⋮ The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation ⋮ Revisiting Stackelberg p-median problem with user preferences ⋮ The exam location problem: mathematical formulations and variants ⋮ The multifacility center problems with random demand weights ⋮ A fresh view on the discrete ordered median problem based on partial monotonicity ⋮ Facility location problems with user cooperation ⋮ Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations ⋮ Facility location and pricing problem: discretized mill price and exact algorithms ⋮ The joint impact of environmental awareness and system infrastructure on e-waste collection ⋮ Locating optimal timetables and vehicle schedules in a transit line ⋮ The rank pricing problem with ties ⋮ Balancing the arrival times of users in a two-stage location problem ⋮ Effects of multipurpose shopping trips on retail store location in a duopoly ⋮ On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem ⋮ Modeling the shelter site location problem using chance constraints: a case study for Istanbul ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ The stratified \(p\)-center problem ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms
Cites Work
- The ordered capacitated facility location problem
- The discrete facility location problem with balanced allocation of customers
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- A branch-and-cut method for the obnoxious \(p\)-median problem
- Optimal location with equitable loads
- Formulating logical implications in combinatorial optimisation
- A hierarchical location model for public facility planning
- A bilevel mixed-integer program for critical infrastructure protection planning
- A strengthened formulation for the simple plant location problem with order
- Uncapacitated Plant Location Under Alternative Spatial Price Policies
- Competitive Location on a Network
- Closest assignment constraints and location models: Properties and structure
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
This page was built for publication: Closest assignment constraints in discrete location problems
