Dynamic versions of set covering type public facility location problems-Reference-Cited by-同舟云学术

Dynamic versions of set covering type public facility location problems

Published:1982-06 Issue:2 Volume:10 Page:190-195
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Gunawardane Gamini

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference16 articles.

1. The maximal covering location problem;Church;Papers Regional Sci. Asso.,1974

2. On the choice of models for public facility location;Erlenkotter,1980

3. A dual-based procedure for dynamic facility location;Erlenkotter,1980

4. Identification of special structure constraints in linear programs;Gunawardane;Math. Programming,1981

5. A heuristic program for locating warehouses;Kuehn;Management Sci.,1963

Cited by 53 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Accelerated Benders decomposition and local branching for dynamic maximum covering location problems;Computers & Operations Research;2024-07

2. Optimization of Shared Electric Scooter Deployment Stations Based on Distance Tolerance;ISPRS International Journal of Geo-Information;2024-04-29

3. Stochastic Facility Location;International Series in Operations Research & Management Science;2024

4. School or parking lot? Selecting locations for points of distribution in urban disasters;Socio-Economic Planning Sciences;2023-10

5. A practical facility location optimization with uncertain variables in emergency road services;2022 IEEE International Conference on Big Data (Big Data);2022-12-17