New lower bounds for bin packing problems with conflicts
From MaRDI portal
Recommendations
- Algorithms for the bin packing problem with conflicts
- Heuristics and lower bounds for the bin packing problem with conflicts
- New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
- Heuristics for solving the bin-packing problem with conflicts
- On Bin Packing with Conflicts
Cites work
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- A new exact method for the two-dimensional orthogonal packing problem
- Algorithms for the bin packing problem with conflicts
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- An improved typology of cutting and packing problems
- Approximation algorithms for combinatorial problems
- Approximation algorithms for time constrained scheduling
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Exact solution of the two-dimensional finite bin packing problem
- Heuristics and lower bounds for the bin packing problem with conflicts
- Heuristics for the container loading problem
- Knapsack problems with setups
- New classes of fast lower bounds for bin packing problems
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Packing problems
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- Two-Dimensional Finite Bin-Packing Algorithms
- Two-dimensional packing problems: a survey
Cited in
(20)- Determining the minimum number of warehouses and their space-size for storing compatible items
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- Algorithms for the two dimensional bin packing problem with partial conflicts
- Bin Packing Problem with Time Lags
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Bin packing problem with conflicts and item fragmentation
- Conservative scales in packing problems
- On the benchmark instances for the bin packing problem with conflicts
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- Queue-constrained packing: a vehicle ferry case study
- An approximation scheme for bin packing with conflicts
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
- New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
- The min-conflict packing problem
- Heuristics and lower bounds for the bin packing problem with conflicts
- Vehicle scheduling under the warehouse-on-wheels policy
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal
- A multi-start tabu search based algorithm for solving the warehousing problem with conflict
- Lower and upper bounds for the bin packing problem with fragile objects
This page was built for publication: New lower bounds for bin packing problems with conflicts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976310)
