A new well-solvable class of PNS problems

DOI10.1007/S006070170026MaRDI QIDQ5943901zbMATH OpenOpenAlexFDO

Authors Csanád Imreh

Publication date 9 April 2002

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s006070170026

zbMATH Keywords

manufacturing systemnetwork

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 1748519
• Reduction techniques for the PNS problems: a novel technique and a review
• scientific article; zbMATH DE number 1354909
• scientific article; zbMATH DE number 1101394
• scientific article; zbMATH DE number 1354969

Cited in

(8)

• Reduction techniques for the PNS problems: a novel technique and a review
• On a merging reduction of the process network synthesis problem
• Process network synthesis: Problem definition
• scientific article; zbMATH DE number 1354908 (Why is no real title available?)
• scientific article; zbMATH DE number 1354969 (Why is no real title available?)
• scientific article; zbMATH DE number 1101394 (Why is no real title available?)
• scientific article; zbMATH DE number 1748519 (Why is no real title available?)
• scientific article; zbMATH DE number 1912022 (Why is no real title available?)

This page was built for publication: A new well-solvable class of PNS problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5943901)