Bin packing problem with conflicts and item fragmentation
From MaRDI portal
Publication:2026980
DOI10.1016/J.COR.2020.105113OpenAlexW3091308197MaRDI QIDQ2026980
Publication date: 21 May 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105113
Related Items (6)
Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ A threshold search based memetic algorithm for the disjunctively constrained knapsack problem ⋮ A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation ⋮ EPTAS for the dual of splittable bin packing with cardinality constraint ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Mathematical programming algorithms for bin packing problems with item fragmentation
- Bin packing and related problems: general arc-flow formulation with graph compression
- Exactly solving packing problems with fragmentation
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- An exact approach for the vertex coloring problem
- Bin packing with fragmentable items: presentation and approximations
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
- Tighter bounds of the First Fit algorithm for the bin-packing problem
- Branching in branch-and-price: A generic scheme
- New bin packing fast lower bounds
- Lower bounds and reduction procedures for the bin packing problem
- Approximation schemes for packing with item fragmentation
- New lower bounds for bin packing problems with conflicts
- Bin packing problems in one dimension: Heuristic solutions and confidence intervals
- 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
- Complexity of fragmentable object bin packing and an application
- Lower bounds for a bin packing problem with linear usage cost
- The min-conflict packing problem
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Heuristics and lower bounds for the bin packing problem with conflicts
- An analysis of lower bound procedures for the bin packing problem
- Hybrid genetic algorithms for bin-packing and related problems
- An approximation scheme for bin packing with conflicts
- New formulations for variable cost and size bin packing problems with item fragmentation
- The bin packing problem with item fragmentation: a worst-case analysis
- Approximation schemes for packing splittable items with cardinality constraints
- Improved results for a memory allocation problem
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- Computing the asymptotic worst-case of bin packing lower bounds
- Column Generation based Primal Heuristics
- Algorithms for the Bin Packing Problem with Conflicts
- A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
- Heuristics for determining the number of warehouses for storing non-compatible products
- Capacitated Vehicle Routing on Trees
- An Application of Bin-Packing to Multiprocessor Scheduling
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Bin‐packing problem with concave costs of bin utilization
- The Loading Problem
- New classes of fast lower bounds for bin packing problems
- New heuristics for one-dimensional bin-packing
This page was built for publication: Bin packing problem with conflicts and item fragmentation
