论文信息 - BILEVEL FACILITY LOCATION : DISCRETE MODELS AND COMPUTATIONAL METHODS - 字舞流文

BILEVEL FACILITY LOCATION : DISCRETE MODELS AND COMPUTATIONAL METHODS

Discrete location theory is one of the dynamic areas in operations research. We present some mathematical models in this field concerning the hierarchical optimization. Main properties of the models and computational methods are reviewed.

YURY KOCHETOV Sobolev | Y. Sobolev

[1] Hans-Christoph Wirth,et al. Multiple voting location and single voting location on trees , 2007, Eur. J. Oper. Res..

[2] A. Kononov,et al. Competitive facility location models , 2009 .

[3] Yury Kochetov,et al. Heuristic and Exact Methods for the Discrete (r |p)-Centroid Problem , 2010, EvoCOP.

[4] Jens Vygen,et al. The Book Review Column1 , 2020, SIGACT News.

[5] Hans-Christoph Wirth,et al. (r, P)-centroid Problems on Paths and Trees , 2009, Theor. Comput. Sci..

[6] Pierre Hansen,et al. Lower Bounds for the Uncapacitated Facility Location Problem with User Preferences , 2004 .

[7] Martine Labbé,et al. A strengthened formulation for the simple plant location problem with order , 2007, Oper. Res. Lett..

[8] Rossiĭskai︠a︡ akademii︠a︡ nauk. Computational mathematics and mathematical physics , 1992 .

[9] Stephan Dempe,et al. Foundations of Bilevel Programming , 2002 .

[10] Simple plant location problem with partial external finance: lower bound, heuristic and exact solution , 1997 .