메뉴 건너뛰기




Volumn 2014, Issue , 2014, Pages

Integer programming formulations for approximate packing circles in a rectangular container

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMOBILE FABRICS; HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMIZATION; TEXTILE INDUSTRY;

EID: 84899484418     PISSN: 1024123X     EISSN: 15635147     Source Type: Journal    
DOI: 10.1155/2014/317697     Document Type: Article
Times cited : (21)

References (17)
  • 1
    • 70849122690 scopus 로고    scopus 로고
    • New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
    • 2-s2.0-70849122690 10.1016/j.cor.2009.09.017
    • Birgin E. G., Gentil J. M., New and improved results for packing identical unitary radius circles within triangles, rectangles and strips. Computers and Operations Research 2010 37 7 1318 1327 2-s2.0-70849122690 10.1016/j.cor.2009.09.017
    • (2010) Computers and Operations Research , vol.37 , Issue.7 , pp. 1318-1327
    • Birgin, E.G.1    Gentil, J.M.2
  • 2
    • 78751537817 scopus 로고    scopus 로고
    • A literature review on circle and sphere packing problems: Models and methodologies
    • 150624 10.1155/2009/150624
    • Hifi M., M'Hallah R., A literature review on circle and sphere packing problems: models and methodologies. Advances in Operations Research 2009 2009 22 150624 10.1155/2009/150624
    • (2009) Advances in Operations Research , vol.2009 , pp. 22
    • Hifi, M.1    M'Hallah, R.2
  • 3
    • 77950858646 scopus 로고    scopus 로고
    • A lagrangian bound for many-to-many assignment problems
    • 2-s2.0-77950858646 10.1007/s10878-008-9196-3
    • Litvinchev I., Rangel S., Saucedo J., A lagrangian bound for many-to-many assignment problems. Journal of Combinatorial Optimization 2010 19 3 241 257 2-s2.0-77950858646 10.1007/s10878-008-9196-3
    • (2010) Journal of Combinatorial Optimization , vol.19 , Issue.3 , pp. 241-257
    • Litvinchev, I.1    Rangel, S.2    Saucedo, J.3
  • 4
    • 33646371708 scopus 로고    scopus 로고
    • The distributor's three-dimensional pallet-packing problem: A human intelligence-based heuristic approach
    • Baltaciolu E., Moore J. T., Hill R. R. Jr., The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach. International Journal of Operational Research 2006 1 3 249 266 2-s2.0-33646371708 (Pubitemid 43664412)
    • (2006) International Journal of Operational Research , vol.1 , Issue.3 , pp. 249-266
    • Baltacioglu, E.1    Moore, J.T.2    Hill Jr., R.R.3
  • 5
    • 3943051316 scopus 로고    scopus 로고
    • Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
    • 2-s2.0-3943051316 10.1016/j.ejor.2003.06.018
    • Birgin E. G., Martínez J. M., Ronconi D. P., Optimizing the packing of cylinders into a rectangular container: a nonlinear approach. European Journal of Operational Research 2005 160 1 19 33 2-s2.0-3943051316 10.1016/j.ejor.2003.06.018
    • (2005) European Journal of Operational Research , vol.160 , Issue.1 , pp. 19-33
    • Birgin, E.G.1    Martínez, J.M.2    Ronconi, D.P.3
  • 6
    • 44649160575 scopus 로고    scopus 로고
    • Solving circle packing problems by global optimization: Numerical results and industrial applications
    • DOI 10.1016/j.ejor.2007.01.054, PII S0377221707004274
    • Castillo I., Kampas F. J., Pintér J. D., Solving circle packing problems by global optimization: numerical results and industrial applications. European Journal of Operational Research 2008 191 3 786 802 2-s2.0-44649160575 10.1016/j.ejor.2007.01.054 (Pubitemid 351778615)
    • (2008) European Journal of Operational Research , vol.191 , Issue.3 , pp. 786-802
    • Castillo, I.1    Kampas, F.J.2    Pinter, J.D.3
  • 7
    • 0001307210 scopus 로고
    • Integrated container loading software for pulp and paper industry
    • 2-s2.0-0001307210
    • Fraser H. J., George J. A., Integrated container loading software for pulp and paper industry. European Journal of Operational Research 1994 77 3 466 474 2-s2.0-0001307210
    • (1994) European Journal of Operational Research , vol.77 , Issue.3 , pp. 466-474
    • Fraser, H.J.1    George, J.A.2
  • 8
    • 0030242605 scopus 로고    scopus 로고
    • Multiple container packing : A case study of pipe packing
    • George J. A., Multiple container packing: a case study of pipe packing. Journal of the Operational Research Society 1996 47 9 1098 1109 2-s2.0-0030242605 (Pubitemid 126605008)
    • (1996) Journal of the Operational Research Society , vol.47 , Issue.9 , pp. 1098-1109
    • George, J.A.1
  • 9
    • 84861198052 scopus 로고    scopus 로고
    • A heuristic for the circle packing problem with a variety of containers
    • 2-s2.0-79956033107 10.1016/j.ejor.2011.04.024
    • López C. O., Beasley J. E., A heuristic for the circle packing problem with a variety of containers. European Journal of Operational Research 2011 214 512 525 2-s2.0-79956033107 10.1016/j.ejor.2011.04.024
    • (2011) European Journal of Operational Research , vol.214 , pp. 512-525
    • López, C.O.1    Beasley, J.E.2
  • 10
    • 84875208057 scopus 로고    scopus 로고
    • Solving the circular open dimension problem using separate beams and look-ahead strategies
    • Akeb H., Hifi M., Solving the circular open dimension problem using separate beams and look-ahead strategies. Computers & Operations Research 2013 40 5 1243 1255
    • (2013) Computers & Operations Research , vol.40 , Issue.5 , pp. 1243-1255
    • Akeb, H.1    Hifi, M.2
  • 12
    • 84875173017 scopus 로고    scopus 로고
    • Packing unequal circles using formulation space search
    • Lopez C. O., Beasley J. E., Packing unequal circles using formulation space search. Computers & Operations Research 2013 40 1276 1288
    • (2013) Computers & Operations Research , vol.40 , pp. 1276-1288
    • Lopez, C.O.1    Beasley, J.E.2
  • 13
    • 84869231498 scopus 로고    scopus 로고
    • Packing congruent spheres into a multi-connected polyhedral domain
    • 10.1111/j.1475-3995.2012.00859.x
    • Stoyan Y. G., Yaskov G. N., Packing congruent spheres into a multi-connected polyhedral domain. International Transactions in Operational Research 2013 20 1 79 99 10.1111/j.1475-3995.2012.00859.x
    • (2013) International Transactions in Operational Research , vol.20 , Issue.1 , pp. 79-99
    • Stoyan, Y.G.1    Yaskov, G.N.2
  • 14
    • 0021789009 scopus 로고
    • Exact two-dimensional non-guillotine cutting tree search procedure
    • Beasley J. E., An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 1985 33 1 49 64 2-s2.0-0021789009 (Pubitemid 15475049)
    • (1985) Operations Research , vol.33 , Issue.1 , pp. 49-64
    • Beasley, J.E.1
  • 15
    • 84879503115 scopus 로고    scopus 로고
    • Linear models for the approximate solution of the problem of packing equal circles into a given domain
    • 10.1016/j.ejor.2013.04.050
    • Galiev S. I., Lisafina M. S., Linear models for the approximate solution of the problem of packing equal circles into a given domain. European Journal of Operational Research 2013 230 3 505 514 10.1016/j.ejor.2013.04.050
    • (2013) European Journal of Operational Research , vol.230 , Issue.3 , pp. 505-514
    • Galiev, S.I.1    Lisafina, M.S.2


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