Note—A Branch-and-Fathom Algorithm for the Long Range Process Design Problem

DOI10.1287/MNSC.36.4.513zbMATH Open0703.90052OpenAlexW2035914010MaRDI QIDQ3483074FDOQ3483074

Authors: Jaya Singhal, Joseph Katz 

Publication date: 1990

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.36.4.513

Recommendations

• A partial enumeration algorithm for solving PNS problems
• scientific article; zbMATH DE number 1058968
• Algorithmical approaches to business process design
• scientific article; zbMATH DE number 970371
• The number of feasible designs in a compatibility matrix

zbMATH Keywords

compatible matrixbranch and fathom algorithmlong-range process design

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10)

Cited In (1)

• The number of feasible designs in a compatibility matrix

This page was built for publication: Note—A Branch-and-Fathom Algorithm for the Long Range Process Design Problem

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