scientific article; zbMATH DE number 1748520

zbMATH Open1017.90118MaRDI QIDQ4530400FDOQ4530400

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

Publication date: 10 July 2002

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

heuristicedge covering problem of weighted graphs

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Heuristics for PNS problems and its empirical analysis
• A note on the equivalence of the set covering and process network synthesis 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 Q4530400)