The k-path coloring problem in graphs of bounded treewidth : an application in integrated circuit manufacturing
Year of publication: |
2020
|
---|---|
Authors: | Ait-Ferhat, Dehia ; Juliard, Vincent ; Stauffer, Gautier ; Torres, Juan Andres |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 5, p. 652-657
|
Subject: | Bounded tree-width | Dynamic programming | Integrated circuit manufacturing | k-path coloring | Industrie | Manufacturing industries | Graphentheorie | Graph theory | Elektronik | Electronics | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung |
-
A new dynamic programming approach for spanning trees with chain constraints and beyond
Nägele, Martin, (2024)
-
A primal adjacency-based algorithm for the shortest path problem with resource constraints
Himmich, Ilyas, (2020)
-
Optimization problems in graphs with locational uncertainty
Bougeret, Marin, (2023)
- More ...
-
Ait-Ferhat, Dehia, (2020)
-
Robust modeling and planning: Insights from three industrial applications
Marla, Lavanya, (2020)
-
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
Liebling, Thomas M., (2004)
- More ...