Solving the variable size bin packing problem with discretized formulations

Computers and Operations Research

Volumn 35, Issue 6, 2008, Pages 2103-2113

  Correia, Isabel ^a   Gouveia, Luís ^b   Saldanha da Gama, Francisco ^b  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^b UNIVERSITY OF LISBON   (Portugal)

Author keywords

Discretized reformulations; Extended formulations; Variable size bin packing

Indexed keywords

COMPUTATIONAL METHODS; COST REDUCTION; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING;

DISCRETIZED FORMULATIONS; DISCRETIZED MODEL REFORMULATION; EXTENDED FORMULATIONS; VARIABLE SIZE BIN PACKING PROBLEM;

OPERATIONS RESEARCH;

EID: 35348992613     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.10.014     Document Type: Article

References (13)

1. Dyckhoff H. A typology of cutting and packing problems. European Journal of Operational Research 44 (1990) 145-159
2. Garey M., and Johnson D. Computers and intractability: a guide to the theory of NP-completeness (1979), W.H. Freeman, San Francisco
3. Friesen D.K., and Langston M.A. Variable sized bin packing. SIAM Journal on Computing 15 (1986) 222-230
4. Kang J., and Park S. Algorithms for the variable sized bin packing problem. European Journal of Operational Research 147 (2003) 365-372
5. Monacci M. Algorithms for packing and scheduling problems. PhD thesis, Università di Bologna, 2002.
6. Belov G., and Scheithauer G. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European Journal of Operational Research 141 (2002) 274-294
7. Alves C, Valério de Carvalho J-M. Accelerating column generation for variable sized bin-packing problems. European Journal of Operational Research 2006, in press, doi: 10.1016/j.ejor.2005.07.033.
8. Alves C, Valério de Carvalho J-M. A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Computers and Operations Research 2006, in press, doi: 10.1016/j.cor.2006.08.014.
9. Pisinger D., and Sigurd M. The two-dimensional bin packing problem with variable bin sizes and costs. Discrete Optimization 2 (2005) 154-167
10. Gouveia L. A 2n constraint formulation for the capacitated minimal spanning tree problem. Operations Research 43 (1995) 130-141
11. Gouveia L., and Saldanha-da-Gama F. On the capacitated concentrator location problem: a reformulation by discretization. Computers and Operations Research 33 (2006) 1242-1258
12. Cornuejols G., Sridharan R., and Thizy J.M. A comparison of heuristics and relaxations for the capacitated plant location problem. European Journal of Operational Research 50 (1991) 280-297
13. ILOG CPLEX 8.0. Using the Cplex Callable Library. Incline Village, Nevada, ILOG Inc., 2002.