A branch-and-bound algorithm for the two-dimensional vector packing problem
Computers and Operations Research
Solving binary cutting stock problems by column generation and branch-and-bound
Computational Optimization and Applications
Algorithms for railway crew management
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
There is no asymptotic PTAS for two-dimensional vector packing
Information Processing Letters
Exact Solution of the Two-Dimensional Finite Bon Packing Problem
Management Science
Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem
Computational Optimization and Applications
New Algorithms for Bin Packing
Journal of the ACM (JACM)
Lower bounds and algorithms for the 2-dimensional vector packing problem
Discrete Applied Mathematics
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
INFORMS Journal on Computing
A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
INFORMS Journal on Computing
A Heuristic Method for the Set Covering Problem
Operations Research
Guided Local Search for the Three-Dimensional Bin-Packing Problem
INFORMS Journal on Computing
A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
Mathematics of Operations Research
Operations Research Letters
INFORMS Journal on Computing
Heuristics for the variable sized bin-packing problem
Computers and Operations Research
Models and heuristic algorithms for a weighted vertex coloring problem
Journal of Heuristics
Computers and Operations Research
Algorithms for the Bin Packing Problem with Conflicts
INFORMS Journal on Computing
INFORMS Journal on Computing
Survey: matheuristics for rich vehicle routing problems
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Bidimensional packing by bilinear programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Space defragmentation heuristic for 2D and 3D bin packing problems
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
A new exact method for the two-dimensional bin-packing problem with fixed orientation
Operations Research Letters
Hi-index | 0.00 |
Several combinatorial optimization problems can be formulated as large set-covering problems. In this work, we use the set-covering formulation to obtain a general heuristic algorithm for this type of problem, and describe our implementation of the algorithm for solving two variants of the well-known (one-dimensional) bin-packing problem: the two-constraint bin-packing problem and the basic version of the two-dimensional bin-packing problem, where the objects cannot be rotated and no additional requirements are imposed. In our approach, both the column-generation and the column-optimization phases are heuristically performed. In particular, in the first phase, we do not generate the entire set of columns, but only a small subset of it, by using greedy procedures and fast constructive heuristic algorithms from the literature. In the second phase, we solve the associated set-covering instance by means of a Lagrangian-based heuristic algorithm. Extensive computational results on test instances from the literature show that, for the two considered problems, this approach is competitive, with respect to both the quality of the solution and the computing time, with the best heuristic and metaheuristic algorithms proposed so far.