A New Algorithm for Computing the Maximal Closure of a Graph
Year of publication: |
1990
|
---|---|
Authors: | Faaland, Bruce ; Kim, Kiseog ; Schmitt, Tom |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 36.1990, 3, p. 315-331
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | graphical algorithms | network flow | minimum cuts |
-
Standardization in information systems
Kimms, A., (2001)
-
Hase, Ryo, (2016)
-
Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain
Boland, Natashia, (2013)
- More ...
-
Scheduling tasks with due dates in a fabrication/assembly process
Faaland, Bruce, (1987)
-
Cost-Based Scheduling of Workers and Equipment in a Fabrication and Assembly Shop
Faaland, Bruce, (1993)
-
Das Status-Spiel beherrschen : Kommunikationsstrategie
Schmitt, Tom, (2012)
- More ...