Minimax location problems with nonlinear costs

DOI10.6028/JRES.082.006MaRDI QIDQ3856442zbMATH OpenOpenAlexFDO

Authors P. M. Dearing

Publication date 1977

Published in Journal of Research of the National Bureau of Standards (Search for Journal in Brave)

Full work available at URL https://doi.org/10.6028/jres.082.006

zbMATH Keywords

facility locationlogisticnetwork locationnonlinear costsone-facility minimax locationspanning trees

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Nonlinear programming (90C30) Programming involving graphs or networks (90C35)

Cited in

(9)

• Location problems with costs being sums of powers of Euclidean distances
• The location of central structures in trees
• Locational analysis
• Special issue on Locational analysis
• Location of rectilinear center trajectories
• Duality results for nonlinear single minimax location problems via multi-composed optimization
• Duality results for extended multifacility location problems
• A minimum-length covering subtree of a tree
• Solving nonlinear multiple-facility network location problems

This page was built for publication: Minimax location problems with nonlinear costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3856442)