RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika. Supplement // Archive
Prikl. Diskr. Mat. Suppl., 2013 Issue 6, Pages 136–137 (Mi pdma113)
Computational methods in discrete mathematics

Exact algorithm for solving special case of discrete Weber problem

R. E. Shangin

South Ural State University, Chelyabinsk

Abstract: An algorithm reasonably solving Weber problem for $n$-sequentially connected chain and finite set of points of location is described. The algorithm is compared with an integer linear programming algorithm realized in IBM ILOG CPLEX.

Keywords: Weber problem, n-sequentially connected chain, dynamic programming, exact algorithm, quasi-polynomial algorithm.

UDC: 519.863


© Steklov Math. Inst. of RAS, 2025