The following pages link to (Q4857376):
Displaying 50 items.
- Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
- Optimizing budget allocation for center and median points (Q265070) (← links)
- A hybrid clonal selection algorithm for the location routing problem with stochastic demands (Q276534) (← links)
- On statistical bounds of heuristic solutions to location problems (Q281793) (← links)
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- The quintile share ratio in location analysis (Q296717) (← links)
- Optimal deployment of alternative fueling stations on transportation networks considering deviation paths (Q301092) (← links)
- The connected \(p\)-median problem on block graphs (Q315481) (← links)
- Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
- Hybrid column generation for large-size covering integer programs: application to transportation planning (Q336412) (← links)
- Robust vertex \(p\)-center model for locating urgent relief distribution centers (Q336453) (← links)
- Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
- A closed-loop location-inventory problem with spare parts consideration (Q337375) (← links)
- A hybrid method for the probabilistic maximal covering location-allocation problem (Q337483) (← links)
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
- An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem (Q337612) (← links)
- When centers can fail: a close second opportunity (Q337641) (← links)
- Local search heuristics for the mobile facility location problem (Q337654) (← links)
- Location modeling for municipal solid waste facilities (Q337671) (← links)
- Restructuring bank networks after mergers and acquisitions: a capacitated delocation model for closing and resizing branches (Q337674) (← links)
- A simulated annealing for multi-criteria network path problems (Q339658) (← links)
- Applying ranking and selection procedures to long-term mitigation for improved network restoration (Q339947) (← links)
- A note on the nestedness property for ordered median problems in tree networks (Q394466) (← links)
- The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
- Organizing hospitals into networks: a hierarchical and multiservice model to define location, supply and referrals in planned hospital systems (Q427495) (← links)
- Sequential competitive location on networks (Q439407) (← links)
- Comparative error bound theory for three location models: continuous demand versus discrete demand (Q458944) (← links)
- Location-allocation models for traffic police patrol vehicles on an interurban network (Q478026) (← links)
- Improving emergency service in rural areas: a bi-objective covering location model for EMS systems (Q478038) (← links)
- Preprocessing for a map sectorization problem by means of mathematical programming (Q490244) (← links)
- Threshold robustness in discrete facility location problems: a bi-objective approach (Q499687) (← links)
- An effective heuristic for the \(P\)-median problem with application to ambulance location (Q505139) (← links)
- The stochastic capacitated branch restructuring problem (Q512982) (← links)
- A parallelized lagrangean relaxation approach for the discrete ordered median problem (Q512991) (← links)
- Maximizing the minimum cover probability by emergency facilities (Q512997) (← links)
- A decision support model for staff allocation of mobile medical service (Q513654) (← links)
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees (Q534329) (← links)
- A multi-criteria decision making approach for location planning for urban distribution centers under uncertainty (Q534809) (← links)
- Multi-facility ordered median problems in directed networks (Q545449) (← links)
- A decomposition heuristic for the maximal covering location problem (Q606191) (← links)
- An exact procedure and LP formulations for the leader-follower location problem (Q611000) (← links)
- Fuzzy goal programming models for analyzing demand coverage (Q611008) (← links)
- Weber problems with high-speed lines (Q611010) (← links)
- Discrete location for bundled demand points (Q611011) (← links)
- Designing robust coverage networks to hedge against worst-case facility losses (Q617512) (← links)
- Bee colony optimization for the \(p\)-center problem (Q632685) (← links)
- Green supply chains with carbon trading and environmental sourcing: formulation and life cycle assessment (Q693560) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Confidence in heuristic solutions? (Q746822) (← links)
- Heuristic procedures for solving the discrete ordered median problem (Q816415) (← links)
