A partial enumeration algorithm for solving PNS problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1354909 (Why is no real title available?)
- scientific article; zbMATH DE number 1058968 (Why is no real title available?)
- scientific article; zbMATH DE number 1101394 (Why is no real title available?)
- scientific article; zbMATH DE number 970371 (Why is no real title available?)
- A note on the equivalence of the set covering and process network synthesis problems
- On a merging reduction of the process network synthesis problem
- Process network synthesis: Problem definition
Cited in
(10)- scientific article; zbMATH DE number 5733069 (Why is no real title available?)
- Heuristics for PNS problems and its empirical analysis
- scientific article; zbMATH DE number 1992425 (Why is no real title available?)
- scientific article; zbMATH DE number 1912022 (Why is no real title available?)
- Reliability considerations for process network synthesis problems
- Reduction techniques for the PNS problems: a novel technique and a review
- Note—A Branch-and-Fathom Algorithm for the Long Range Process Design Problem
- A look ahead branch and bound procedure for solving PNS problems
- On a merging reduction of the process network synthesis problem
- Partial enumeration in heuristics for some combinatorial optimization problems
This page was built for publication: A partial enumeration algorithm for solving PNS problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596980)
