SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Volumn 29, Issue 4, 2007, Pages 765-781

Two heuristics for the one-dimensional bin-packing problem

(2) Singh, Alok a Gupta, Ashok K a

a UNIVERSITY OF ALLAHABAD (India)

Author keywords

Combinatorial optimization; Grouping genetic algorithm; Heuristic; One dimensional bin packing

Indexed keywords

EID: 34547158649 PISSN: 01716468 EISSN: 14366304 Source Type: Journal
DOI: 10.1007/s00291-006-0071-2 Document Type: Article

Times cited : (40)

References (16)

1
- 3543061170
- A hybrid improvement heuristic for the one dimensional bin packing problem
- Alvim ACF, Ribeiro CC, Glover F, Aloise DJ (2004) A hybrid improvement heuristic for the one dimensional bin packing problem. J Heuristics 10:205-229
- (2004) J Heuristics , vol.10 , pp. 205-229
- Alvim, A.C.F.¹ Ribeiro, C.C.² Glover, F.³ Aloise, D.J.⁴

2
- 33750728098
- Packing bins using multi-chromosomal genetic representation and better fit heuristic
- Springer, Berlin Heidelberg New York, pp
- Bhatia AK, Basu SK (2004) Packing bins using multi-chromosomal genetic representation and better fit heuristic. Lecture notes in computer science, vol 3316. Springer, Berlin Heidelberg New York, pp 181-186
- (2004) Lecture notes in computer science , vol.3316 , pp. 181-186
- Bhatia, A.K.¹ Basu, S.K.²

3
- 0042094654
- Exact solution of bin packing problem using column generation and branch and bound
- Carvalho JMV De (1999) Exact solution of bin packing problem using column generation and branch and bound. Ann Oper Res 86:629-659
- (1999) Ann Oper Res , vol.86 , pp. 629-659
- De, C.J.M.V.¹

4
- 0002026363
- Approximation algorithm for bin packing: A survey
- Hochbaum D ed, PWS Publishing, Boston, pp
- Coffman Jr. EG, Garey MR, Johnson DS (1997) Approximation algorithm for bin packing: a survey. In: Hochbaum D (ed) Approximation algorithm for NP-hard problems. PWS Publishing, Boston, pp 46-93
- (1997) Approximation algorithm for NP-hard problems , pp. 46-93
- Coffman Jr., E.G.¹ Garey, M.R.² Johnson, D.S.³

5
- 0000967003
- Solving equal piles with the grouping genetic algorithm
- Morgan Kaufman, San Matco, pp
- Falkenauer E (1995) Solving equal piles with the grouping genetic algorithm. In: Proceedings of the 6th international conference on genetic algorithms (ICGA 95). Morgan Kaufman, San Matco, pp 492-497
- (1995) Proceedings of the 6th international conference on genetic algorithms (ICGA 95) , pp. 492-497
- Falkenauer, E.¹

6
- 0030174048
- A hybrid grouping genetic algorithm for the bin packing
- Falkenauer E (1996) A hybrid grouping genetic algorithm for the bin packing. J Heuristics 2:5-30
- (1996) J Heuristics , vol.2 , pp. 5-30
- Falkenauer, E.¹

7
- 0036604755
- New heuristics for one dimensional bin-packing
- Fleszar K, Hindi KS (2002) New heuristics for one dimensional bin-packing. Comput Oper Res 29:821-839
- (2002) Comput Oper Res , vol.29 , pp. 821-839
- Fleszar, K.¹ Hindi, K.S.²

8
- 0000965650
- Hybrid evolutionary algorithms for graph coloring
- Galinier P, Hao JK (1999) Hybrid evolutionary algorithms for graph coloring. J Comb Optim 3:379-397
- (1999) J Comb Optim , vol.3 , pp. 379-397
- Galinier, P.¹ Hao, J.K.²

9
- 0003603813
- W. H. Freeman, San Francisco
- Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-com pleteness. W. H. Freeman, San Francisco
- (1979) Computers and intractability: A guide to the theory of NP-com pleteness
- Garey, M.R.¹ Johnson, D.S.²

10
- 0032651360
- A new heuristic algorithm for the one-dimensional bin-packing problem
- Gupta JND, Ho JC (1999) A new heuristic algorithm for the one-dimensional bin-packing problem. Prod Plan Control 10:598-603
- (1999) Prod Plan Control , vol.10 , pp. 598-603
- Gupta, J.N.D.¹ Ho, J.C.²

11
- 38249020984
- Lower bounds and reduction procedures for the bin packing problem
- Martello S, Toth P (1990a) Lower bounds and reduction procedures for the bin packing problem. Discrete Appl Math 28:59-70
- (1990) Discrete Appl Math , vol.28 , pp. 59-70
- Martello, S.¹ Toth, P.²

12
- 0004229857
- Wiley, Chichester
- Martello S, Toth P (1990b) Knapsack problems: algorithms and computer implemnatations. Wiley, Chichester
- (1990) Knapsack problems: Algorithms and computer implemnatations
- Martello, S.¹ Toth, P.²

13
- 0031185499
- BISON: A fast hybrid procedure for exactly solving the one dimensional bin packing problem
- Scholl A, Klein R, Jurgens C (1997) BISON: a fast hybrid procedure for exactly solving the one dimensional bin packing problem. Comput Oper Res 24:627-645
- (1997) Comput Oper Res , vol.24 , pp. 627-645
- Scholl, A.¹ Klein, R.² Jurgens, C.³

14
- 85040470141
- The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP
- Schwerin P, Wäscher G (1997) The bin-packing problem: a problem generator and some numerical experiments with FFD packing and MTP. Int Trans Oper Res 4:377-389
- (1997) Int Trans Oper Res , vol.4 , pp. 377-389
- Schwerin, P.¹ Wäscher, G.²

15
- 0000222680
- A new lower bound for the bin-packing problem and its integratin into MTP
- Schwerin P, Wäscher G (1999) A new lower bound for the bin-packing problem and its integratin into MTP. Pesquisa Operacional 19:111-129
- (1999) Pesquisa Operacional , vol.19 , pp. 111-129
- Schwerin, P.¹ Wäscher, G.²

16
- 0000596106
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Wäscher G, Gau T (1996) Heuristics for the integer one-dimensional cutting stock problem: a computational study. OR Spektrum 18:131-144
- (1996) OR Spektrum , vol.18 , pp. 131-144
- Wäscher, G.¹ Gau, T.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.