Exact Solution of the Two-Dimensional Finite Bin Packing Problem
From MaRDI portal
Publication:2783932
DOI10.1287/mnsc.44.3.388zbMath0989.90114MaRDI QIDQ2783932
Silvano Martello, Daniele Vigo
Publication date: 17 April 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.44.3.388
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
65Y20: Complexity and performance of numerical algorithms
Related Items
Recent advances on two-dimensional bin packing problems, Packing into the smallest square: worst-case analysis of lower bounds, New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation, Two- and three-dimensional parametric packing, Reactive GRASP for the strip-packing problem, Ant colony optimization for the two-dimensional loading vehicle routing problem, A lower bound for the non-oriented two-dimensional bin packing problem, On the two-dimensional knapsack problem, Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles, Approximation algorithm for the oriented two-dimensional bin packing problem, New lower bounds for the three-dimensional finite bin packing problem, Two-dimensional packing problems: a survey, A guided tabu search for the vehicle routing problem with two-dimensional loading constraints, On solving multiobjective bin packing problems using evolutionary particle swarm optimization, Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds, A new constraint programming approach for the orthogonal packing problem, A new exact method for the two-dimensional bin-packing problem with fixed orientation, A new lower bound for the non-oriented two-dimensional bin-packing problem, New resolution algorithm and pretreatments for the two-dimensional bin-packing problem, A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces, The two-dimensional bin packing problem with variable bin sizes and costs, An improved typology of cutting and packing problems, PackLib\(^{2}\): an integrated library of multi-dimensional packing problems, A hybrid genetic algorithm for the two-dimensional single large object placement problem, A new exact method for the two-dimensional orthogonal packing problem, Models and algorithms for three-stage two-dimensional bin packing, Analysis of distributed genetic algorithms for solving cutting problems
Uses Software
