An integer programming approach to optimal basic block instruction scheduling for single-issue processors.
Michael JüngerSven MallachPublished in: Discret. Optim. (2016)
Keyphrases
- integer programming
- instruction scheduling
- constraint programming
- lagrangian relaxation
- np hard
- constraint satisfaction problems
- production planning
- ai planning
- column generation
- search strategies
- network flow
- linear programming
- set covering
- set covering problem
- cutting plane algorithm
- constraint satisfaction
- cutting plane
- optimal solution
- integer program
- parallel processing
- orders of magnitude
- valid inequalities
- vehicle routing problem with time windows
- lower bound