Tailoring Instances of the 1D Bin Packing Problem for Assessing Strengths and Weaknesses of Its Solvers.
Iván AmayaJosé Carlos Ortiz-BaylissSantiago Enrique Conant-PablosHugo Terashima-MarínCarlos A. Coello CoelloPublished in: PPSN (2) (2018)
Keyphrases
- strengths and weaknesses
- advantages and disadvantages
- sat instances
- relative strengths and weaknesses
- multiple knapsack
- lower bound
- bin packing
- randomly generated
- training instances
- sat solvers
- pseudo boolean
- backtracking search
- mixed integer linear
- propositional satisfiability
- branch and bound algorithm
- computationally hard problems
- branch and bound