A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with Bounded Tree-width.
Eric AngelSébastien MoraisDamien RegnaultPublished in: CoRR (2022)
Keyphrases
- bicriteria
- tree width
- shortest path problem
- scheduling problem
- efficient solutions
- constraint networks
- flowshop
- structural properties
- integer linear programming
- tree decomposition
- random walk
- global constraints
- precedence constraints
- knapsack problem
- constraint programming
- directed graph
- graph theory
- exact and approximate