-
1
-
-
0021946689
-
Probabilistic bounds for dual bin-packing
-
J. Bruno, P. Downey. Probabilistic bounds for dual bin-packing, Acta Informatica, 22:333-345, 1985.
-
(1985)
Acta Informatica
, vol.22
, pp. 333-345
-
-
Bruno, J.1
Downey, P.2
-
2
-
-
0008785637
-
Bin packing: Maximizing the number of pieces packed
-
E. Coffman, J. Leung, D. Ting. Bin packing: Maximizing the number of pieces packed, Acta Informatica, 9:263-271, 1978.
-
(1978)
Acta Informatica
, vol.9
, pp. 263-271
-
-
Coffman, E.1
Leung, J.2
Ting, D.3
-
3
-
-
0030303866
-
Solving multiple knapsack problems by cutting planes
-
C. Ferreira, A. Martin, R. Weismantel. Solving multiple knapsack problems by cutting planes, SIAM Journal on Optimization, 6:858-877, 1996.
-
(1996)
SIAM Journal on Optimization
, vol.6
, pp. 858-877
-
-
Ferreira, C.1
Martin, A.2
Weismantel, R.3
-
5
-
-
84958763526
-
A polynomial time approximation scheme for the multiple knapsack problem
-
in Randomization, (D. Hochbaum, K. Jansen, J. Rolim, and A. Sinclair, editors), Springer, Berlin
-
H. Kellerer. A polynomial time approximation scheme for the multiple knapsack problem, in Randomization, Approximation, and Combinatorial Algorithms and Techniques (D. Hochbaum, K. Jansen, J. Rolim, and A. Sinclair, editors), 51-62, Springer, Berlin, 1999.
-
(1999)
Approximation, and Combinatorial Algorithms and Techniques
, pp. 51-62
-
-
Kellerer, H.1
-
6
-
-
0038577482
-
Upper bounds and algorithms for the maximum cardinality bin packing problem
-
M. Labbé, G. Laporte, S. Martello. Upper bounds and algorithms for the maximum cardinality bin packing problem, European Journal of Operational Research, 149: 490-498, 2003.
-
(2003)
European Journal of Operational Research
, vol.149
, pp. 490-498
-
-
Labbé, M.1
Laporte, G.2
Martello, S.3
-
7
-
-
84855287820
-
-
Ph.D. dissertation, Robert H. Smith School of Business, University of Maryland, College Park, Maryland
-
K-H. Loh. Weight annealing heuristics for solving bin packing and other combinatorial optimization problems: Concepts, algorithms, and computational results, Ph.D. dissertation, Robert H. Smith School of Business, University of Maryland, College Park, Maryland, 2006.
-
(2006)
Weight annealing heuristics for solving bin packing and other combinatorial optimization problems: Concepts, algorithms, and computational results
-
-
Loh, K.-H.1
-
9
-
-
38249020984
-
Lower bounds and reduction procedures for the bin-packing problem
-
S. Martello, P. Toth. Lower bounds and reduction procedures for the bin-packing problem, Discrete Applied Mathematics, 26:59-70, 1990.
-
(1990)
Discrete Applied Mathematics
, vol.26
, pp. 59-70
-
-
Martello, S.1
Toth, P.2
-
10
-
-
13444267483
-
Weight annealing
-
M. Ninio, J. Schneider. Weight annealing, Physica A, 349:649-666, 2005.
-
(2005)
Physica A
, vol.349
, pp. 649-666
-
-
Ninio, M.1
Schneider, J.2
-
11
-
-
26844582095
-
Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
-
M. Peeters, Z. Degraeve. Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem, European Journal of Operational Research, 170:416-439, 2006.
-
(2006)
European Journal of Operational Research
, vol.170
, pp. 416-439
-
-
Peeters, M.1
Degraeve, Z.2
|