메뉴 건너뛰기




Volumn 118, Issue 1, 2009, Pages 75-108

Bidimensional packing by bilinear programming

Author keywords

Bidimensional packing; Bilinear programming; Computational experiments; Dual feasible functions

Indexed keywords

CONTROL THEORY; FUNCTIONS; INTEGER PROGRAMMING; PROBABILITY DENSITY FUNCTION; TOPOLOGY;

EID: 58149489805     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-007-0184-7     Document Type: Article
Times cited : (32)

References (45)
  • 2
    • 0026904595 scopus 로고
    • Generalized bilinear programming: Part I. Models, applications and linear programming relaxation
    • F.A. Al-Khayyal 1992 Generalized bilinear programming: Part I. Models, applications and linear programming relaxation Eur. J. Oper. Res. 60 306 314
    • (1992) Eur. J. Oper. Res. , vol.60 , pp. 306-314
    • Al-Khayyal, F.A.1
  • 3
    • 0034345414 scopus 로고    scopus 로고
    • On finitely terminating branch-and-bound algorithms for some global optimization problems
    • F.A. Al-Khayyal H.D. Sherali 2000 On finitely terminating branch-and-bound algorithms for some global optimization problems SIAM J. Optim. 10 1049 1057
    • (2000) SIAM J. Optim. , vol.10 , pp. 1049-1057
    • Al-Khayyal, F.A.1    Sherali, H.D.2
  • 5
    • 0343137998 scopus 로고    scopus 로고
    • A symmetrical linear maxmin approach to disjoint bilinear programming
    • C. Audet P. Hansen B. Jaumard G. Savard 1999 A symmetrical linear maxmin approach to disjoint bilinear programming Math. Program. 85 573 592
    • (1999) Math. Program. , vol.85 , pp. 573-592
    • Audet, C.1    Hansen, P.2    Jaumard, B.3    Savard, G.4
  • 7
    • 0023344708 scopus 로고
    • Two dimensional finite bin packing algorithms
    • J.O. Berkey P.Y. Wang 1987 Two dimensional finite bin packing algorithms J. Oper. Res. Soc. 38 423 429
    • (1987) J. Oper. Res. Soc. , vol.38 , pp. 423-429
    • Berkey, J.O.1    Wang, P.Y.2
  • 8
    • 84891649542 scopus 로고    scopus 로고
    • The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case
    • M.A. Boschetti A. Mingozzi 2003 The two-dimensional finite bin packing problem. Part I: new lower bounds for the oriented case 4OR 1 27 42
    • (2003) 4OR , vol.1 , pp. 27-42
    • Boschetti, M.A.1    Mingozzi, A.2
  • 9
    • 9744282784 scopus 로고    scopus 로고
    • The two-dimensional finite bin packing problem. Part II: New lower and upper bounds
    • M.A. Boschetti A. Mingozzi 2003 The two-dimensional finite bin packing problem. Part II: new lower and upper bounds 4OR 1 135 147
    • (2003) 4OR , vol.1 , pp. 135-147
    • Boschetti, M.A.1    Mingozzi, A.2
  • 10
    • 0011263866 scopus 로고
    • A pseudopolynomial network flow formulation for exact knapsack separation
    • E.A. Boyd 1992 A pseudopolynomial network flow formulation for exact knapsack separation Networks 22 503 514
    • (1992) Networks , vol.22 , pp. 503-514
    • Boyd, E.A.1
  • 14
    • 24944585466 scopus 로고    scopus 로고
    • Bidimensional packing by bilinear programming
    • Jünger, M., Kaibel, V. (eds.) Proceedings of the 11th Conference on Integer Programming and Combinatorial Optimization (IPCO'05) Berlin Springer, Berlin
    • Caprara, A., Locatelli, M., Monaci, M.: Bidimensional packing by bilinear programming. In: Jünger, M., Kaibel, V. (eds.) Proceedings of the 11th Conference on Integer Programming and Combinatorial Optimization (IPCO'05), Lecture Notes in Computer Science 3509, Berlin, pp. 377-391. Springer, Berlin (2005)
    • (2005) Lecture Notes in Computer Science , vol.3509 , pp. 377-391
    • Caprara, A.1    Locatelli, M.2    Monaci, M.3
  • 15
    • 31144458958 scopus 로고    scopus 로고
    • Fast approximation schemes for two-stage, two-dimensional bin packing
    • A. Caprara A. Lodi M. Monaci 2005 Fast approximation schemes for two-stage, two-dimensional bin packing Math. Oper. Res. 30 136 156
    • (2005) Math. Oper. Res. , vol.30 , pp. 136-156
    • Caprara, A.1    Lodi, A.2    Monaci, M.3
  • 16
    • 0142124833 scopus 로고    scopus 로고
    • On the 2-dimensional knapsack problem
    • A. Caprara M. Monaci 2004 On the 2-dimensional knapsack problem Oper. Res. Lett. 32 5 14
    • (2004) Oper. Res. Lett. , vol.32 , pp. 5-14
    • Caprara, A.1    Monaci, M.2
  • 17
    • 0012526114 scopus 로고    scopus 로고
    • Worst-case analyses, linear programming and the bin packing problem
    • L.M.A. Chan D. Simchi-Levi J. Bramel 1998 Worst-case analyses, linear programming and the bin packing problem Math. Program. 83 213 227
    • (1998) Math. Program. , vol.83 , pp. 213-227
    • Chan, L.M.A.1    Simchi-Levi, D.2    Bramel, J.3
  • 18
    • 0020815626 scopus 로고
    • Solving large-scale zero-one linear programming problems
    • H. Crowder E. Johnson M.W. Padberg 1983 Solving large-scale zero-one linear programming problems Oper. Res. 31 803 834
    • (1983) Oper. Res. , vol.31 , pp. 803-834
    • Crowder, H.1    Johnson, E.2    Padberg, M.W.3
  • 19
    • 0027576155 scopus 로고
    • An on-line algorithm for multidimensional bin packing
    • J. Csirik A. van Vliet 1993 An on-line algorithm for multidimensional bin packing Oper. Res. Lett. 13 149 158
    • (1993) Oper. Res. Lett. , vol.13 , pp. 149-158
    • Csirik, J.1    Van Vliet, A.2
  • 20
    • 0025488353 scopus 로고
    • A note on bounding a class of linear programming problems, including cutting stock problems
    • A.A. Farley 1990 A note on bounding a class of linear programming problems, including cutting stock problems Oper. Res. 38 922 923
    • (1990) Oper. Res. , vol.38 , pp. 922-923
    • Farley, A.A.1
  • 21
    • 0012575285 scopus 로고    scopus 로고
    • New classes of fast lower bounds for bin packing problems
    • S.P. Fekete J. Schepers 2001 New classes of fast lower bounds for bin packing problems Math. Program. 91 11 31
    • (2001) Math. Program. , vol.91 , pp. 11-31
    • Fekete, S.P.1    Schepers, J.2
  • 22
    • 4043106962 scopus 로고    scopus 로고
    • A combinatorial characterization of higher-dimensional orthogonal packing
    • S.P. Fekete J. Schepers 2004 A combinatorial characterization of higher-dimensional orthogonal packing Math. Oper. Res. 29 353 368
    • (2004) Math. Oper. Res. , vol.29 , pp. 353-368
    • Fekete, S.P.1    Schepers, J.2
  • 23
    • 4043118460 scopus 로고    scopus 로고
    • A general framework for bounds for higher-dimensional orthogonal packing problems
    • S.P. Fekete J. Schepers 2004 A general framework for bounds for higher-dimensional orthogonal packing problems Math. Methods Oper. Res. 60 311 329
    • (2004) Math. Methods Oper. Res. , vol.60 , pp. 311-329
    • Fekete, S.P.1    Schepers, J.2
  • 24
    • 38549109642 scopus 로고    scopus 로고
    • An exact algorithm for higher-dimensional orthogonal packing
    • S.P. Fekete J. Schepers J.C. van der Veen 2007 An exact algorithm for higher-dimensional orthogonal packing Oper. Res. 55 569 587
    • (2007) Oper. Res. , vol.55 , pp. 569-587
    • Fekete, S.P.1    Schepers, J.2    Van Der Veen, J.C.3
  • 25
    • 51249181640 scopus 로고
    • Bin packing can be solved within 1 + ε in linear time
    • W. Fernandezdela Vega G.S. Lueker 1981 Bin packing can be solved within 1 + ε in linear time Combinatorica 1 349 355
    • (1981) Combinatorica , vol.1 , pp. 349-355
    • Fernandezdela Vega, W.1    Lueker, G.S.2
  • 26
    • 0002854108 scopus 로고
    • Quadratic optimization
    • Horst, R., Pardalos, P.M. (eds.) Kluwer, Dordrecht
    • Floudas, C.A., Visweswaran, V.: Quadratic optimization. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization. Kluwer, Dordrecht (1995)
    • (1995) Handbook of Global Optimization
    • Floudas, C.A.1    Visweswaran, V.2
  • 27
    • 0002662534 scopus 로고
    • Multistage cutting problems of two and more dimensions
    • P.C. Gilmore R.E. Gomory 1965 Multistage cutting problems of two and more dimensions Oper. Res. 13 94 119
    • (1965) Oper. Res. , vol.13 , pp. 94-119
    • Gilmore, P.C.1    Gomory, R.E.2
  • 28
    • 51249185617 scopus 로고
    • The ellipsoid method and its consequences in combinatorial optimization
    • M. Grötschel L. Lovász A. Schrijver 1981 The ellipsoid method and its consequences in combinatorial optimization Combinatorica 1 169 197
    • (1981) Combinatorica , vol.1 , pp. 169-197
    • Grötschel, M.1    Lovász, L.2    Schrijver, A.3
  • 30
    • 0005314510 scopus 로고
    • On linear characterization of combinatorial optimization problems
    • R.M. Karp C.H. Papadimitriou 1982 On linear characterization of combinatorial optimization problems SIAM J. Comput. 11 620 632
    • (1982) SIAM J. Comput. , vol.11 , pp. 620-632
    • Karp, R.M.1    Papadimitriou, C.H.2
  • 32
    • 0022093691 scopus 로고
    • A simple on-line bin packing algorithm
    • C.C. Lee D.T. Lee 1985 A simple on-line bin packing algorithm J. ACM 32 562 572
    • (1985) J. ACM , vol.32 , pp. 562-572
    • Lee, C.C.1    Lee, D.T.2
  • 33
    • 0034156490 scopus 로고    scopus 로고
    • The three-dimensional bin packing problem
    • S. Martello D. Pisinger D. Vigo 2000 The three-dimensional bin packing problem Oper. Res. 48 256 267
    • (2000) Oper. Res. , vol.48 , pp. 256-267
    • Martello, S.1    Pisinger, D.2    Vigo, D.3
  • 34
    • 38249020984 scopus 로고
    • Lower bounds and reduction rrocedures for the bin packing problem
    • S. Martello P. Toth 1990 Lower bounds and reduction rrocedures for the bin packing problem Discret. Appl. Math. 28 59 70
    • (1990) Discret. Appl. Math. , vol.28 , pp. 59-70
    • Martello, S.1    Toth, P.2
  • 36
    • 0032023068 scopus 로고    scopus 로고
    • Exact solution of the two-dimensional finite bin packing problem
    • S. Martello D. Vigo 1998 Exact solution of the two-dimensional finite bin packing problem Manage. Sci. 44 388 399
    • (1998) Manage. Sci. , vol.44 , pp. 388-399
    • Martello, S.1    Vigo, D.2
  • 37
    • 34250381644 scopus 로고
    • Computability of global solutions to factorable nonconvex programs-part I-convex underestimating problems
    • G.P. McCormick 1976 Computability of global solutions to factorable nonconvex programs-part I-convex underestimating problems Math. Program. 10 147 175
    • (1976) Math. Program. , vol.10 , pp. 147-175
    • McCormick, G.P.1
  • 38
    • 33645581547 scopus 로고    scopus 로고
    • A set-covering based heuristic approach for bin-packing problems
    • M. Monaci P. Toth 2006 A set-covering based heuristic approach for bin-packing problems INFORMS J. Comput. 18 71 85
    • (2006) INFORMS J. Comput. , vol.18 , pp. 71-85
    • Monaci, M.1    Toth, P.2
  • 41
    • 54449098516 scopus 로고    scopus 로고
    • On using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem
    • D. Pisinger M.M. Sigurd 2007 On using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem INFORMS J. Comput. 19 36 51
    • (2007) INFORMS J. Comput. , vol.19 , pp. 36-51
    • Pisinger, D.1    Sigurd, M.M.2
  • 42
    • 58149527511 scopus 로고    scopus 로고
    • Personal communication
    • Rizzi, R.: Personal communication (1998)
    • (1998)
    • Rizzi, R.1
  • 43
    • 0028734225 scopus 로고
    • On the MAXGAP problem for cutting stock problems
    • G. Scheithauer 1994 On the MAXGAP problem for cutting stock problems J. Info. Process. Cybern. 30 111 117
    • (1994) J. Info. Process. Cybern. , vol.30 , pp. 111-117
    • Scheithauer, G.1
  • 44
    • 0029634676 scopus 로고
    • The modified integer round-up property of the one-dimensional cutting stock problem
    • G. Scheithauer J. Terno 1995 The modified integer round-up property of the one-dimensional cutting stock problem Eur. J. Oper. Res. 84 562 571
    • (1995) Eur. J. Oper. Res. , vol.84 , pp. 562-571
    • Scheithauer, G.1    Terno, J.2
  • 45
    • 0942279287 scopus 로고    scopus 로고
    • New bounds for multi-dimensional packing
    • S.S. Seiden R. van Stee 2003 New bounds for multi-dimensional packing Algorithmica 36 261 293
    • (2003) Algorithmica , vol.36 , pp. 261-293
    • Seiden, S.S.1    Van Stee, R.2


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