Estimating Lower-Bound Performance of Schedules Using a Relaxation Technique.
Minjoong RimRajiv JainPublished in: ICCD (1992)
Keyphrases
- lower bound
- upper bound
- objective function
- linear programming relaxation
- lagrangian relaxation
- np hard
- scheduling problem
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- optimal solution
- worst case
- integrality gap
- probabilistic relaxation
- linear programming
- upper and lower bounds
- lower bounding
- rigid body
- sufficiently accurate
- polynomial approximation
- tight upper and lower bounds
- concept class
- iterative algorithms
- multi step
- data sets
- column generation
- integer programming
- learning algorithm