scientific article; zbMATH DE number 1101394

MaRDI QIDQ4370840zbMATH OpenFDO

Authors Zoltán Blázsik, Balázs Imreh

Publication date 7 January 1998

zbMATH Keywords

computational complexityNP-hardprocess network synthesis

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1354909
• A note on the equivalence of the set covering and process network synthesis problems
• A new well-solvable class of PNS problems
• scientific article; zbMATH DE number 1748519
• Reduction techniques for the PNS problems: a novel technique and a review

Cited in

(7)

• Reduction techniques for the PNS problems: a novel technique and a review
• Reliability considerations for process network synthesis problems
• A note on the equivalence of the set covering and process network synthesis problems
• scientific article; zbMATH DE number 1354909 (Why is no real title available?)
• scientific article; zbMATH DE number 1748519 (Why is no real title available?)
• A new well-solvable class of PNS problems
• A partial enumeration algorithm for solving PNS problems

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