A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
From MaRDI portal
Publication:6536478
DOI10.1007/s10100-023-00858-0MaRDI QIDQ6536478
Publication date: 13 May 2024
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
- Relaxations and exact solution of the variable sized bin packing problem
- Heuristics for the variable sized bin-packing problem
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Efficient algorithms for real-life instances of the variable size bin packing problem
- Variable neighbourhood search for the variable sized bin packing problem
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Algorithms for the variable sized bin packing problem
- A hybrid evolutionary algorithm for the offline Bin Packing Problem
- A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
- An EDA for the 2D knapsack problem with guillotine constraint
- Bin packing with general cost structures
- Efficient algorithms for the offline variable sized bin-packing problem
- Solving the variable size bin packing problem with discretized formulations
- The two-dimensional bin packing problem with variable bin sizes and costs
- Accelerating column generation for variable sized bin-packing problems
- Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Variable Sized Bin Packing
- Orthogonal Packings in Two Dimensions
- The Three-Dimensional Bin Packing Problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
Related Items (1)
This page was built for publication: A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536478)