A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
From MaRDI portal
Publication:2892273
DOI10.1287/ijoc.1040.0089zbMath1241.90191MaRDI 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
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
A metaheuristic framework for nonlinear capacitated covering problems, A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem, A single machine scheduling problem with two-dimensional vector packing constraints, An optimization-based heuristic for the machine reassignment problem, Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing, A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing, The multiple container loading cost minimization problem, Stabilized branch-and-price algorithms for vector packing problems, Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints, A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes, Bidimensional packing by bilinear programming, Heuristics for the variable sized bin-packing problem, Models and heuristic algorithms for a weighted vertex coloring problem, Space defragmentation for packing problems, Exact solution techniques for two-dimensional cutting and packing, A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows, Deterministic model for customized pilot manufacture production with various backplane sizes, A branch-and-price algorithm for the two-dimensional vector packing problem, A new exact method for the two-dimensional bin-packing problem with fixed orientation, A variable neighborhood descent approach for the two-dimensional bin packing problem, Models and algorithms for three-stage two-dimensional bin packing, Hybrid approach for the two-dimensional bin packing problem with two-staged patterns, HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS
Uses Software
