Pages that link to "Item:Q439609"

The following pages link to Closest assignment constraints in discrete location problems (Q439609):

Displaying 31 items.

• The maximin HAZMAT routing problem (Q299771) (← links)
• Location-allocation approaches for hospital network planning under uncertainty (Q300066) (← links)
• Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
• Efficient solution of a class of location-allocation problems with stochastic demand and congestion (Q337037) (← links)
• When centers can fail: a close second opportunity (Q337641) (← links)
• Locating optimal timetables and vehicle schedules in a transit line (Q490235) (← links)
• Balancing the arrival times of users in a two-stage location problem (Q512992) (← links)
• On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem (Q522273) (← links)
• Hub interdiction problem variants: models and metaheuristic solution algorithms (Q723928) (← links)
• The probabilistic \(p\)-center problem: planning service for potential customers (Q1683071) (← links)
• Effects of multipurpose shopping trips on retail store location in a duopoly (Q1750496) (← links)
• Modeling the shelter site location problem using chance constraints: a case study for Istanbul (Q1754735) (← links)
• Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← links)
• The stratified \(p\)-center problem (Q2003436) (← links)
• A fresh view on the discrete ordered median problem based on partial monotonicity (Q2189878) (← links)
• The rank pricing problem with ties (Q2239986) (← links)
• Facility location under service level constraints for heterogeneous customers (Q2399319) (← links)
• Facility location problems with user cooperation (Q2421328) (← links)
• Capacity management in public service facility networks: a model, computational tests and a case study (Q2629906) (← links)
• An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network (Q2631282) (← links)
• The leader multipurpose shopping location problem (Q2672066) (← links)
• Upgrading edges in the maximal covering location problem (Q2673553) (← links)
• Location of Emergency Facilities with Uncertainty in the Demands (Q4555566) (← links)
• The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation (Q6047913) (← links)
• Revisiting Stackelberg p-median problem with user preferences (Q6065620) (← links)
• The exam location problem: mathematical formulations and variants (Q6065634) (← links)
• The multifacility center problems with random demand weights (Q6065899) (← links)
• Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations (Q6160435) (← links)
• Facility location and pricing problem: discretized mill price and exact algorithms (Q6167526) (← links)
• The joint impact of environmental awareness and system infrastructure on e-waste collection (Q6168500) (← links)
• Applying robust optimization to the shelter location-allocation problem: a case study for Istanbul (Q6601550) (← links)