The minisum and minimax location problems revisited. (English) Zbl 0582.90027

Hansen, Pierre; Peeters, Dominique; Richard, Denis; Thisse, Jacques- François

Oper. Res. 33, 1251-1265 (1985).

The purpose of the paper is to study a generalisation of the minisum and minimax problems by considering transportation costs that are nonlinear functions of distances. The set of feasible locations is restricted to the union of a finite number of convex polygons and distances are approximated by \(\ell_ p\)-norms which may change with the given points. Two solution methods are presented with computational results.

Reviewer: P.Loridan

MSC:

90B05	Inventory, storage, reservoirs
90C99	Mathematical programming
65K05	Numerical mathematical programming methods

Keywords:

sum of the weighted distances; restricted location area; facility location; minisum and minimax problems; nonlinear functions of distances; solution methods; computational results