Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network

DOI10.1287/opre.31.2.292zbMath0507.90024OpenAlexW2146500544WikidataQ52708340 ScholiaQ52708340MaRDI QIDQ4745579

P. M. Dearing, Douglas R. Shier

Publication date: 1983

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.31.2.292

zbMATH Keywords

logisticstree networksnonlinear objective functionsingle-facility locationalgorithmic proceduresoptimal location on a networklocally optimal locations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)

Related Items

Distance weighted voting and a single facility location problem, Single-facility huff location problems on networks, Unnamed Item, Norm statistics and the complexity of clustering problems, Aggregation error for location models: Survey and analysis, Distances in benzenoid systems: Further developments, Discrete Center Problems