Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times
The minimum-cost arborescence problem is a well-studied problem. Polynomial-time algorithms for solving it exist. Recently, a new variation of the problem called the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times was presented and proven to be <inline-formula><m...
| Autores principales: | , , |
|---|---|
| Formato: | Artículo |
| Lenguaje: | English |
| Publicado: |
MDPI AG
2023-12-01
|
| Colección: | Algorithms |
| Materias: | |
| Acceso en línea: | https://www.mdpi.com/1999-4893/17/1/12 |