A large neighborhood search algorithm and lower bounds for the variable-Sized bin packing problem with conflicts.
Ali EkiciPublished in: Eur. J. Oper. Res. (2023)
Keyphrases
- variable sized
- lower bound
- search algorithm
- branch and bound
- upper bound
- max sat
- branch and bound algorithm
- search algorithm for solving
- objective function
- np hard
- conflict resolution
- optimal solution
- upper and lower bounds
- lower and upper bounds
- worst case
- search space
- search methods
- cooperative
- resolving conflicts
- neighborhood information
- quadratic assignment problem
- selection algorithm
- linear programming relaxation
- heuristic search
- metaheuristic
- neighborhood structure
- lower bounding
- search tree
- image registration
- set of randomly generated instances