A branch-and-bound algorithm for the two-dimensional vector packing problem

DOI10.1016/0305-0548(94)90059-0zbMath0789.90063OpenAlexW2058596271MaRDI QIDQ1317086

Frits C. R. Spieksma

Publication date: 24 March 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90059-0

zbMATH Keywords

branch-and-boundheuristictwo-dimensional vector packingfirst fit decreasing rule

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem, A single machine scheduling problem with two-dimensional vector packing constraints, A two-dimensional vector packing model for the efficient use of coil cassettes, An optimization-based heuristic for the machine reassignment problem, Fast machine reassignment, Vector bin packing with heterogeneous bins: application to the machine reassignment problem, BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing, Approximation and online algorithms for multidimensional bin packing: a survey, Compact integer linear programming formulations for the temporal bin packing problem with fire-ups, An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs, A 4/3-APPROXIMATION ALGORITHM FOR CASSETTE PACKING IN STEEL INDUSTRY, Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows, A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function, Lower bounds and algorithms for the 2-dimensional vector packing problem, Stabilized branch-and-price algorithms for vector packing problems, Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups, A branch-and-price algorithm for the two-dimensional vector packing problem, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, A Comparative Study of Multi-objective Evolutionary Algorithms for the Bi-objective 2-Dimensional Vector Packing Problem, Using VRPSolver to efficiently solve the \textsc{differential harvest problem}, An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resource constrained scheduling as generalized bin packing
• Bithreshold Graphs
• Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms