최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기Operations research, v.48 no.2, 2000년, pp.256 - 267
Martello, Silvano (DEIS, University of Bologna, Viale Risorgimento 2, Bologna, Italy) , Pisinger, David (DIKU, University of Copenhagen, University Parken 1, Copenhagen, Denmark) , Vigo, Daniele (DEIS, University of Bologna, Viale Risorgimento 2, Bologna, Italy)
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum number of three-dimensional rectangular bins. The problem is strongly NP-hard and extremely difficult to solve in practice. Lower bounds are discussed, and it is proved that ...
Berkey, J. O., Wang, P. Y.. Two-Dimensional Finite Bin-Packing Algorithms. The journal of the Operational Research Society, vol.38, no.5, 423-429.
Bischoff, E.E., Marriott, M.D.. A comparative evaluation of heuristics for container loading. European journal of operational research, vol.44, no.2, 267-276.
Chen, C.S., Lee, S.M., Shen, Q.S.. An analytical model for the container loading problem. European journal of operational research, vol.80, no.1, 68-76.
Christofides, Nicos, Whitlock, Charles. An Algorithm for Two-Dimensional Cutting Problems. Operations research, vol.25, no.1, 30-44.
Chung, F. R. K., Garey, M.R., Johnson, D.S.. On Packing Two-Dimensional Bins. SIAM journal on algebraic and discrete methods, vol.3, no.1, 66-76.
Approximation Algorithms for NP-Hard Problems Coffman E. G. 1997
Dell’Amico, Mauro, Martello, Silvano. Optimal Scheduling of Tasks on Identical Parallel Processors. ORSA journal on computing, vol.7, no.2, 191-200.
Dyckhoff, H.. A typology of cutting and packing problems. European journal of operational research, vol.44, no.2, 145-159.
Annotated Bibliographies in Combinatorial Optimization Dyckhoff H. 1997
Gehring, H., Menschner, K., Meyer, M.. A computer-based heuristic for packing pooled shipment containers. European journal of operational research, vol.44, no.2, 277-288.
George, J.A., Robinson, D.F.. A heuristic for packing boxes into a container. Computers & operations research, vol.7, no.3, 147-156.
Hadjiconstantinou, Eleni, Christofides, Nicos. An exact algorithm for general, orthogonal, two-dimensional knapsack problems. European journal of operational research, vol.83, no.1, 39-56.
Enumerative Approaches to Combinatorial Optimization-Part 2, volume 11, Annals of Operations Research Ibaraki T. 1987
Labbé, Martine, Laporte, Gilbert, Mercure, Hélène. Capacitated Vehicle Routing on Trees. Operations research, vol.39, no.4, 616-622.
Li, Keqin, Cheng, Kam-Hoi. On Three-Dimensional Packing. SIAM journal on computing, vol.19, no.5, 847-867.
Knapsack Problems: Algorithms and Computer Implementations Martello S. 1990
Martello, S., Toth, P.. Lower bounds and reduction procedures for the bin packing problem. Discrete applied mathematics, vol.28, no.1, 59-70.
Martello, Silvano, Vigo, Daniele. Exact Solution of the Two-Dimensional Finite Bin Packing Problem. Management science, vol.44, no.3, 388-399.
Proceedings NOAS'97 Pisinger D. 1997
J. Inform. Process. Cybernet. Scheithauer G. 263 27 1991
Ricerca Operativa Scheithauer G. 3 83 1997
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.