Optimal and Near-Optimal Global Register Allocation Using 0-1 Integer Programming.
David W. GoodwinKent D. WilkenPublished in: Softw. Pract. Exp. (1996)
Keyphrases
- integer programming
- np hard
- linear programming
- optimal allocation
- cutting plane
- optimal solution
- network flow
- constraint programming
- cutting plane algorithm
- production planning
- dantzig wolfe decomposition
- set covering problem
- set covering
- column generation
- vehicle routing problem with time windows
- lagrangian relaxation
- transportation problem
- ai planning
- set partitioning
- integer program
- facility location
- minimum cost
- resource allocation
- allocation policy
- integer programming formulations
- tabu search
- genetic algorithm
- evolutionary algorithm
- special case
- worst case