scientific article; zbMATH DE number 3659294

MaRDI QIDQ3858032zbMATH OpenFDO

Authors

Publication date 1980

zbMATH Keywords

computational complexitypolynomial algorithmsdual problemstrong duality resultfacility location on a treeround-trip covering problemround-trip l-center problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Integer programming (90C10)

Cited in

(3)

• Solving covering problems and the uncapacitated plant location problem on trees
• Analytical models for locating undesirable facilities
• Optimisation and hypergraph theory

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 Q3858032)