New lower bounds for bin packing problems with conflicts
DOI10.1016/J.EJOR.2010.01.037zbMATH Open1188.90214OpenAlexW2049071849MaRDI QIDQ976310FDOQ976310
Authors: Ali Khanafer, François Clautiaux, El-Ghazali Talbi 
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.01.037
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
lower boundstree-decompositionchordal graphsdual-feasible functionsKnapsack problembin packing with conflicts
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Approximation algorithms for combinatorial problems
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- An improved typology of cutting and packing problems
- Heuristics and lower bounds for the bin packing problem with conflicts
- Algorithms for the bin packing problem with conflicts
- Two-dimensional packing problems: a survey
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Title not available (Why is that?)
- Exact solution of the two-dimensional finite bin packing problem
- Two-Dimensional Finite Bin-Packing Algorithms
- 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
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- Packing problems
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- Heuristics for the container loading problem
- A new exact method for the two-dimensional orthogonal packing problem
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- Knapsack problems with setups
- Approximation algorithms for time constrained scheduling
Cited In (20)
- Vehicle scheduling under the warehouse-on-wheels policy
- Determining the Minimum Number of Warehouses and their Space-Size for Storing Compatible Items
- Lower and upper bounds for the bin packing problem with fragile objects
- Conservative scales in packing problems
- 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
- Heuristics and lower bounds for the bin packing problem with conflicts
- Queue-constrained packing: a vehicle ferry case study
- Bin Packing Problem with Time Lags
- An approximation scheme for bin packing with conflicts
- Algorithms for the two dimensional bin packing problem with partial conflicts
- On the benchmark instances for the bin packing problem with conflicts
- A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict
- The min-conflict packing problem
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- 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
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- Bin packing problem with conflicts and item fragmentation
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)
