scientific article
From MaRDI portal
Publication:3858032
zbMath0423.90057MaRDI QIDQ3858032
No author found.
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitydual problempolynomial algorithmsstrong duality resultfacility location on a treeround-trip covering problemround-trip l-center problem
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30)
Related Items (3)
Analytical models for locating undesirable facilities ⋮ Optimisation and hypergraph theory ⋮ Solving covering problems and the uncapacitated plant location problem on trees
This page was built for publication:
