A New Algorithm for Computing the Maximal Closure of a Graph
From MaRDI portal
Publication:3491289
DOI10.1287/mnsc.36.3.315zbMath0708.90025OpenAlexW1963504164MaRDI QIDQ3491289
Tom Schmitt, Kiseog Kim, Bruce Faaland
Publication date: 1990
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.36.3.315
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
The Parametric Closure Problem, Maximal closure on a graph with resource constraints, Speedup the optimization of maximal closure of a node-weighted directed acyclic graph, Optimal mechanism design for the private supply of a public good