Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem-Reference-Cited by-同舟云学术

Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

Published:2007-02 Issue:1 Volume:19 Page:36-51
ISSN:1091-9856
Container-title:INFORMS Journal on Computing
language:en
Short-container-title:INFORMS Journal on Computing

Author:

Pisinger David,Sigurd Mikkel

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

General Engineering

Link

https://pubsonline.informs.org/doi/pdf/10.1287/ijoc.1060.0181

Reference36 articles.

1. Principles of Constraint Programming

2. Belov G. Problems, models and algorithms in one- and two-dimensional cutting. (2003) . Ph.D. thesis, Institute of Numerical Mathematics, Technischen Universität Dresden, Dresden, Germany

3. Packing Rectangular Pieces--A Heuristic Approach

4. Two-Dimensional Finite Bin-Packing Algorithms

5. Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming

Cited by 129 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions;Algorithms;2024-05-18

2. Operational Research: methods and applications;Journal of the Operational Research Society;2023-12-27

3. Instance space analysis for 2D bin packing mathematical models;European Journal of Operational Research;2023-12

4. Robust Optimization for the Two-Dimensional Strip-Packing Problem with Variable-Sized Bins;Mathematics;2023-11-27

5. A tailored adaptive large neighborhood search algorithm for the air cargo partitioning problem with a piecewise linear cost function;Soft Computing;2023-08-03