Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
DOI10.1007/S10479-012-1283-2zbMATH Open1303.90085OpenAlexW1981764439WikidataQ58644318 ScholiaQ58644318MaRDI QIDQ490206FDOQ490206
Authors: Mauro Maria Baldi, Teodor Gabriel Crainic, Guido Perboli, Roberto Tadei 
Publication date: 22 January 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1283-2
Recommendations
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
- Heuristics for the variable sized bin-packing problem
- New formulations for variable cost and size bin packing problems with item fragmentation
- Solving bin packing problems using VRPSolver models
- An exact algorithm for the type-constrained and 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?)
- Algorithms for the variable sized bin packing problem
- Column Generation
- Accelerating column generation for variable sized bin-packing problems
- Heuristics for the variable sized bin-packing problem
- Variable neighbourhood search for the variable sized bin packing problem
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Solving the variable size bin packing problem with discretized formulations
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
- 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
- Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms
- Relaxations and exact solution of the variable sized bin packing problem
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
Cited In (15)
- Solving bin packing problems using VRPSolver models
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Branch and Price for Chance-Constrained Bin Packing
- On the generalized bin packing problem
- The risk-averse traveling repairman problem with profits
- A generalized bin packing problem for parcel delivery in last-mile logistics
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers
- Solving a large cutting problem in the glass manufacturing industry
- Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
- Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning
- Variable neighbourhood search for the variable sized 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
- A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
Uses Software
This page was built for publication: Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490206)
