Closest assignment constraints in discrete location problems
From MaRDI portal
Publication:439609
Recommendations
- Closest assignment constraints and location models: Properties and structure
- Location with preferences
- The double-assignment plant location problem with co-location
- The capacity and distance constrained plant location problem
- A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
Cites work
- A bilevel mixed-integer program for critical infrastructure protection planning
- A branch-and-cut method for the obnoxious \(p\)-median problem
- A hierarchical location model for public facility planning
- A strengthened formulation for the simple plant location problem with order
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- Closest assignment constraints and location models: Properties and structure
- Competitive Location on a Network
- Formulating logical implications in combinatorial optimisation
- Optimal location with equitable loads
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- The discrete facility location problem with balanced allocation of customers
- The ordered capacitated facility location problem
- Uncapacitated Plant Location Under Alternative Spatial Price Policies
Cited in
(36)- A fresh view on the discrete ordered median problem based on partial monotonicity
- Capacity management in public service facility networks: a model, computational tests and a case study
- The stratified \(p\)-center problem
- Revisiting Stackelberg p-median problem with user preferences
- The exam location problem: mathematical formulations and variants
- The multifacility center problems with random demand weights
- The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
- Location of Emergency Facilities with Uncertainty in the Demands
- An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network
- Adjacency on the constrained assignment problem
- Applying robust optimization to the shelter location-allocation problem: a case study for Istanbul
- The leader multipurpose shopping location problem
- The probabilistic \(p\)-center problem: planning service for potential customers
- Discrete location problems with push-pull objectives
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- Facility location and pricing problem: discretized mill price and exact algorithms
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- The rank pricing problem with ties
- Capacitated \(p\)-center problem with failure foresight
- Locating optimal timetables and vehicle schedules in a transit line
- Upgrading edges in the maximal covering location problem
- Facility location problems with user cooperation
- On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem
- The joint impact of environmental awareness and system infrastructure on e-waste collection
- Efficient solution of a class of location-allocation problems with stochastic demand and congestion
- Balancing the arrival times of users in a two-stage location problem
- When centers can fail: a close second opportunity
- Effects of multipurpose shopping trips on retail store location in a duopoly
- Closest assignment constraints and location models: Properties and structure
- 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
- Location-allocation approaches for hospital network planning under uncertainty
- The maximin HAZMAT routing problem
- Facility location under service level constraints for heterogeneous customers
- Location with preferences
- Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations
This page was built for publication: Closest assignment constraints in discrete location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439609)
