A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
From MaRDI portal
Publication:6167663
DOI10.1016/j.ejor.2022.12.042OpenAlexW4313479085MaRDI QIDQ6167663
Publication date: 10 July 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.2022.12.042
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Thirty years of heterogeneous vehicle routing
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- Online variable-sized bin packing with conflicts
- Relaxations and exact solution of the variable sized bin packing problem
- Tighter bounds of the First Fit algorithm for the bin-packing problem
- Approximation algorithms for time constrained scheduling
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- New lower bounds for bin packing problems with conflicts
- Heuristics for the variable sized bin-packing problem
- Online variable-sized bin packing
- Approximation algorithms for combinatorial problems
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Applying tabu search with influential diversification to multiprocessor scheduling
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Efficient algorithms for real-life instances of the variable size bin packing problem
- Variable neighbourhood search for the variable sized bin packing problem
- Heuristics and lower bounds for the bin packing problem with conflicts
- Algorithms for the variable sized bin packing problem
- Worst-case analysis of the FFH algorithm for online variable-sized bin packing
- An approximation scheme for bin packing with conflicts
- Bin packing problem with conflicts and item fragmentation
- The freight consolidation and containerization problem
- Efficient algorithms for the offline variable sized bin-packing problem
- Solving the variable size bin packing problem with discretized formulations
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- Accelerating column generation for variable sized bin-packing problems
- Algorithms for the Bin Packing Problem with Conflicts
- A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- On Bin Packing with Conflicts
- Heuristics for determining the number of warehouses for storing non-compatible products
- Distributed Approximation Algorithm for Resource Clustering
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- Variable Sized Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- New classes of fast lower bounds for bin packing problems
- New heuristics for one-dimensional bin-packing
