scientific article; zbMATH DE number 3854768

MaRDI QIDQ3323658zbMATH OpenFDO

Authors Eh. Kh. Gimadi

Publication date 1983

zbMATH Keywords

acyclic networkconnectivity propertylogisticsNP-hard problemoptimal plant location on a networkstandardizationunification

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4051314
• scientific article; zbMATH DE number 1882349
• Solving the uncapacited plant location problem on trees
• Locating A Median Subtree On A Network
• On the connectedness property of service areas for the Network Facility Location Problem

Cited in

(7)

• Uniform capacitated facility location problem with random input data
• An optimal algorithm for an outerplanar facility location problem with improved time complexity
• On the connectedness property of service areas for the Network Facility Location Problem
• scientific article; zbMATH DE number 4051314 (Why is no real title available?)
• scientific article; zbMATH DE number 4085384 (Why is no real title available?)
• scientific article; zbMATH DE number 1882349 (Why is no real title available?)
• The capacitated facility location problem with random input data

This page was built for publication:

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