Speedup the optimization of maximal closure of a node-weighted directed acyclic graph
Year of publication: |
2022
|
---|---|
Authors: | Chen, Zhi-Ming ; Lee, Cheng-Hsiung ; Lai, Hung-Lin |
Published in: |
Opsearch : journal of the Operational Research Society of India. - New Delhi : Springer India, ISSN 0975-0320, ZDB-ID 2516085-0. - Vol. 59.2022, 4, p. 1413-1437
|
Subject: | Maximal closure | Node-weighted directed acyclic graph | Optimal monotonic Boolean function | Pruning cost | Weighted partial order set | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
Enumeration of the facets of cut polytopes over some highly symmetric graphs
Deza, Michel, (2016)
-
Mathematical models and routing algorithms for economical cutting tool paths
Makarovskikh, T. A., (2018)
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
- More ...
-
Scheduling with multi-attribute setup times on two identical parallel machines
Lee, Cheng-Hsiung, (2014)
-
Scheduling with multi-attribute set-up times on unrelated parallel machines
Liao, Ching-Jong, (2016)
-
Lee, Cheng-Hsiung, (2018)
- More ...