Relaxations and exact solution of the variable sized bin packing problem
From MaRDI portal
Publication:535302
DOI10.1007/S10589-009-9276-ZzbMATH Open1219.90141OpenAlexW1977859510MaRDI QIDQ535302FDOQ535302
Authors: Mohamed Haouari, Mehdi Serairi 
Publication date: 11 May 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9276-z
Recommendations
- Variable Sized Bin Packing
- Heuristics for the variable sized bin-packing problem
- Algorithms for the variable sized bin packing problem
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
- Variable neighbourhood search for the variable sized bin packing problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Worst-case analysis of the subset sum algorithm for bin packing.
- Algorithms for the variable sized bin packing problem
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- The two-dimensional bin packing problem with variable bin sizes and costs
- Accelerating column generation for variable sized bin-packing problems
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- An improved lower bound for the bin packing problem
- Solving the variable size bin packing problem with discretized formulations
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- Variable Sized Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- Bin packing with divisible item sizes
- Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms
- Worst-case analysis of the FFH algorithm for online variable-sized bin packing
- Variable sized bin packing with color constraints
- Tight bounds for the identical parallel machine‐scheduling problem: Part II
Cited In (18)
- Efficient algorithms for real-life instances of the variable size bin packing problem
- Solving bin packing problems using VRPSolver models
- Lower bounds for a bin packing problem with linear usage cost
- A generalized bin packing problem for parcel delivery in last-mile logistics
- Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem
- Efficient algorithms for the offline variable sized bin-packing problem
- An exact algorithm for the type-constrained and variable sized bin packing problem
- Heuristics for the variable sized bin-packing problem
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
- The freight consolidation and containerization problem
- Variable neighbourhood search for the variable sized bin packing problem
- On the Impact of Fuzzy Constraints in the Variable Size and Cost Bin Packing Problem
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
- A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- Solving the variable size bin packing problem with discretized formulations
Uses Software
This page was built for publication: Relaxations and exact solution of the variable sized bin packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535302)
