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 |
-
Optimization problems in graphs with locational uncertainty
Bougeret, Marin, (2023)
-
New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem
Maristany de las Casas, Pedro, (2025)
-
A primal adjacency-based algorithm for the shortest path problem with resource constraints
Himmich, Ilyas, (2020)
- More ...
-
Ait-Ferhat, Dehia, (2020)
-
The p-median polytype of Y-free graphs : an application of the matching theory
Stauffer, Gautier, (2008)
-
Approximation algorithms for k-echelon extensions of the one warehouse multi-retailer problem
Stauffer, Gautier, (2018)
- More ...