1. Integer rounding for polymatroid and branching optimization problems;Baum;SIAM J. Algebraic Discrete Methods,1981
2. Worst-case analyses, linear programming and the bin-packing problem;Chan;Math. Program.,1998
3. Exact and heuristic solutions for combinatorial optimization problems;Díaz~Díaz,2012
4. Friendly bin packing instances without integer round-up property;Caprara;Math. Program. Ser. A B,2014
5. Bin packing via discrepancy of permutations;Eisenbrand;ACM Trans. Algorithms (TALG),2013