Ranking lower bounds for the bin-packing problem.
Samir ElhedhliPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- np hard
- ranking algorithm
- optimal solution
- upper and lower bounds
- web search
- quadratic assignment problem
- learning to rank
- worst case
- lower and upper bounds
- objective function
- link analysis
- vc dimension
- ranked list
- ranking functions
- special case
- rank order
- set of randomly generated instances
- sample complexity
- pairwise
- max sat
- linear programming relaxation
- rank aggregation
- search space
- optimal cost
- randomly generated problems