scientific article; zbMATH DE number 25606

MaRDI QIDQ3984073zbMATH OpenFDO

Authors Du Ding-Zhu, Xiufeng Du

Publication date 27 June 1992

zbMATH Keywords

NP-completenessexistence of polynomial time heuristics

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The valve location problem in simple network topologies
• The Valve Location Problem in Simple Network Topologies
• scientific article; zbMATH DE number 1067871
• Publication:4725744

Cited in

(2)

• On complexity of subset interconnection designs
• The valve location problem in simple network topologies

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