scientific article; zbMATH DE number 1748520

MaRDI QIDQ4530400zbMATH OpenFDO

Authors Zoltán Blázsik, Kornél Keserű, Zoltán Kovács

Publication date 10 July 2002

zbMATH Keywords

edge covering problem of weighted graphsheuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Heuristics for PNS problems and its empirical analysis
• scientific article; zbMATH DE number 1748519
• scientific article; zbMATH DE number 1354909
• A note on the equivalence of the set covering and process network synthesis problems
• Reduction techniques for the PNS problems: a novel technique and a review

Cited in

(3)

• A note on the equivalence of the set covering and process network synthesis problems
• Heuristics for PNS problems and its empirical analysis
• scientific article; zbMATH DE number 1748519 (Why is no real title available?)

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