scientific article; zbMATH DE number 1163292

MaRDI QIDQ4394810zbMATH OpenFDO

Authors Dušan Hvalica

Publication date 11 June 1998

zbMATH Keywords

AND/OR graphsminimal solution subgraphproject management

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 970004
• Searching for a minimal solution subgraph in explicit AND/OR graphs
• Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
• Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm

Cited in

(8)

• Tractability, hardness, and kernelization lower bound for and/or graph solution
• A general heuristic bottom-up procedure for searching AND/OR graphs
• Revisiting the complexity of and/or graph solution
• scientific article; zbMATH DE number 2089979 (Why is no real title available?)
• ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS
• scientific article; zbMATH DE number 2219699 (Why is no real title available?)
• Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm
• Searching for a minimal solution subgraph in explicit AND/OR graphs

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