A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
From MaRDI portal
Publication:2892273
DOI10.1287/ijoc.1040.0089zbMath1241.90191OpenAlexW2139771428MaRDI QIDQ2892273
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bc330acf7dfed96717eed061c69aa149dd982e33
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem, A variable neighborhood descent approach for the two-dimensional bin packing problem, A single machine scheduling problem with two-dimensional vector packing constraints, Adaptive simulated annealing with greedy search for the circle bin packing problem, Models and algorithms for three-stage two-dimensional bin packing, An optimization-based heuristic for the machine reassignment problem, Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation, Space defragmentation for packing problems, A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing, An introduction to the two‐dimensional rectangular cutting and packing problem, Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows, The multiple container loading cost minimization problem, HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS, A new exact method for the two-dimensional bin-packing problem with fixed orientation, A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes, Exact solution techniques for two-dimensional cutting and packing, Stabilized branch-and-price algorithms for vector packing problems, Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints, A metaheuristic framework for nonlinear capacitated covering problems, Hybrid approach for the two-dimensional bin packing problem with two-staged patterns, Bidimensional packing by bilinear programming, Heuristics for the variable sized bin-packing problem, Deterministic model for customized pilot manufacture production with various backplane sizes, A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows, Models and heuristic algorithms for a weighted vertex coloring problem, A branch-and-price algorithm for the two-dimensional vector packing problem, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
Uses Software
