Lower and upper bounding procedures for the bin packing problem with concave loading cost
From MaRDI portal
Publication:6069214
DOI10.1016/j.ejor.2023.06.028OpenAlexW4381194523MaRDI QIDQ6069214
Publication date: 14 November 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.06.028
Cites Work
- Unnamed Item
- Bin packing and related problems: general arc-flow formulation with graph compression
- Stabilized branch-and-price algorithms for vector packing problems
- An asymptotic approximation scheme for the concave cost bin packing problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Worst-case analysis of the subset sum algorithm for bin packing.
- BPPLIB: a library for bin packing and cutting stock problems
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
- Lower bounds for a bin packing problem with linear usage cost
- Exact solution techniques for two-dimensional cutting and packing
- Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
- A branch-and-price algorithm for the two-dimensional vector packing problem
- A branch-and-price algorithm for the temporal bin packing problem
- Bin packing with general cost structures
- Combinatorial optimization. Theory and applications.
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Multi-objective temporal bin packing problem: an application in cloud computing
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Variable Sized Bin Packing
- Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Bin‐packing problem with concave costs of bin utilization
- A Primer in Column Generation
This page was built for publication: Lower and upper bounding procedures for the bin packing problem with concave loading cost
