scientific article; zbMATH DE number 4786

DOI10.1002/1520-6750(199004)37:2%3C245::AID-NAV3220370205%3E3.0.CO;2-DMaRDI QIDQ4712671zbMATH OpenFDO

Authors John W. Chinneck

Publication date 25 June 1992

Full work available at URL https://doi.org/10.1002/1520-6750(199004)37:2%3C245::AID-NAV3220370205%3E3.0.CO;2-D

zbMATH Keywords

processing networkprocessing node

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 4145634
• scientific article; zbMATH DE number 1058029
• scientific article; zbMATH DE number 1944276
• Network survivability modeling
• The complexity of reconfiguring network models
• A Contribution to the Theory of Network Synthesis
• Network synthesis under survivability constraints
• scientific article; zbMATH DE number 4085629
• Processing Networks

Cites work

• scientific article; zbMATH DE number 3628660 (Why is no real title available?)
• scientific article; zbMATH DE number 3633709 (Why is no real title available?)
• The simplex SON algorithm for LP/embedded network problems

Cited in

(5)

• LP modeling languages for personal computers: A comparison
• Syntax-directed report writing in linear programming using ANALYZE
• Generating and evaluating process redesign options: A network modeling approach
• Consistency, redundancy, and implied equalities in linear systems
• Irreducible infeasible sets in convex mixed-integer programs

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