Login / Signup
Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times.
Mauro Dell'Amico
Jafar Jamal
Roberto Montemanni
Published in:
Algorithms (2024)
Keyphrases
</>
minimum cost
waiting times
np hard
network flow problem
approximation algorithms
probabilistic model
network flow
linear programming
convex hull