An algorithmic characterization of total digraphs
Year of publication: |
1983
|
---|---|
Authors: | Skowrońska, Miroslawa ; Syslo, Maciej M. ; Zamfirescu, Christina |
Publisher: |
Bonn : Inst., Univ. |
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
Extent: | 15 S. |
---|---|
Series: | Report / OR. - Bonn : Inst. für Ökonometrie und Operations-Research, ISSN 0724-3138, ZDB-ID 265820-3. - Vol. 83,302 |
Type of publication: | Book / Working Paper |
Language: | English |
Source: | ECONIS - Online Catalogue of the ZBW |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
- More ...
-
Remarks on Dillworth partially ordered sets
Syslo, Maciej M., (1985)
-
A solvable case of the set-partitioning problem
Syslo, Maciej M., (1983)
-
Series-parallel graphs and depth-first search trees
Syslo, Maciej M., (1983)
- More ...