A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint

Annals of Operations Research

Volumn 179, Issue 1, 2010, Pages 221-241

  Bettinelli, Andrea ^a   Ceselli, Alberto ^a   Righini, Giovanni ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Bin packing; Branch and price; Column generation

Indexed keywords

EID: 77956059574     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-008-0452-9     Document Type: Article

References (21)

1. Achterberg, T. (2004). SCIP-a framework to integrate constraint and mixed integer programming (ZIB report 04-19). Berlin.
2. Alves, C., & Valerio de Carvalho, J. M. (2007). Accelerating column generation for variable sized bin-packing problems. European Journal of Operational Research, 183, 1333-1352.
3. Alves, C., & Valerio de Carvalho, J. M. (2008). A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Computers and Operations Research, 35, 1315-1328.
4. Belov, G., & Scheithauer, G. (2002). A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European Journal of Operational Research, 141, 274-294.
5. Brønmo, G., Christiansen, M., & Nygreen, B. (2007a). Ship scheduling with flexible Cargo sizes. Journal of the Operational Research Society, 58, 1167-1177.
6. Brønmo, G., Nygreen, B., & Lysgaard, J. (2007b). Approximate column generation for some ship scheduling problems. In Proc. TRISTAN VI. Phuket Island, Thailand.
7. Cappanera, P., & Trubian, M. (2005). A local search based heuristic for the demand constrained multidimensional knapsack problem. INFORMS Journal on Computing, 17, 82-98.
8. Chu, C., & La, R. (2001). Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms. SIAM Journal on Computing, 30, 2069-2083.
9. Correia, I., Gouveia, L., & Saldanha da Gama, F. (2008). Solving the variable size bin packing problem with discretized formulations. Computers and Operations Research, 35, 2103-2113.
10. Friesen, D. K., & Langston, M. A. (1986). Variable sized bin packing. SIAM Journal on Computing, 15, 222-230.
11. Gouveia, L. (1995). A 2n constraint formulation for the capacitated minimal spanning tree problem. Operations Research, 43, 130-141.
12. Grønhaug, R., Christiansen, M., Desaulniers, G., & Desrosiers, J. (2007). Inventory routing problem for the LNG business. In Proc. TRISTAN VI. Phuket Island, Thailand.
13. Kang, J., & Park, S. (2003). Algorithms for the variable sized bin packing problem. European Journal of Operational Research, 147, 365-372.
14. Lodi, A., Martello, S., & Vigo, D. (2004). Models and bounds for two dimensional packing problems. Journal of Combinatorial Optimization, 8, 363-379.
15. Martello, S., & Toth, P. (1990). Knapsack problems: Algorithms and computer implementations. New York: Wiley (Available online).
16. Monaci, M. (2002). Algorithms for packing and scheduling problems. PhD thesis OR/02/4, DEIS, Università di Bologna.
17. Murgolo, F. D. (1988). An efficient approximation scheme for variable-sized bin packing. SIAM Journal on Computing, 21, 229-243.
18. Pisinger, D. (2000). A minimal algorithm for the bounded knapsack problem. INFORMS Journal on Computing, 34, 75-84.
19. Ryan, D. M., & Foster, B. A. (1981). An integer programming approach to scheduling. In A. Wren (Ed.), Computer scheduling of public transport urban passenger vehicle and crew scheduling. Amsterdam: North-Holland.
20. Valerio de Carvalho, J. M. (2005). Using extra dual cuts to accelerate column generation. INFORMS Journal on Computing, 17(2), 175-182.
21. Walkowiak, R. (2005). Shipment cost optimization. In European chapter on combinatorial optimization XVIII. Minsk.