Worst-case analyses, linear programming and the bin-packing problem.
Lap Mui Ann ChanDavid Simchi-LeviJulien BramelPublished in: Math. Program. (1998)
Keyphrases
- linear programming
- worst case
- lower bound
- np hard
- optimal solution
- upper bound
- linear program
- objective function
- average case
- knapsack problem
- bin packing
- primal dual
- feasible solution
- error bounds
- dynamic programming
- quadratic programming
- network flow
- worst case analysis
- greedy algorithm
- approximation algorithms
- integer programming
- mathematical programming
- computational complexity
- packing problem
- variable sized
- neural network
- running times
- sample size
- scheduling problem
- data sets
- constraint propagation
- branch and bound
- nonlinear programming
- online algorithms
- statistical analysis
- worst case scenario