Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
DOI10.1016/J.COR.2010.07.009zbMATH Open1251.90282OpenAlexW1976513369MaRDI QIDQ1761944FDOQ1761944
Authors: Ali Khanafer, François Clautiaux, El-Ghazali Talbi 
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.07.009
Recommendations
- Heuristics and lower bounds for the bin packing problem with conflicts
- Heuristics for solving the bin-packing problem with conflicts
- Algorithms for the two dimensional bin packing problem with partial conflicts
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
- An approximation scheme for bin packing with conflicts
- An approximation scheme for bin packing with conflicts
- scientific article; zbMATH DE number 5911854
- Heuristic placement routines for two-dimensional bin packing problem
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Heuristics and lower bounds for the bin packing problem with conflicts
- Incidence matrices and interval graphs
- Algorithms for the bin packing problem with conflicts
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- New lower bounds for bin packing problems with conflicts
- Graph minors. II. Algorithmic aspects of tree-width
- 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
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
- Two-Dimensional Finite Bin-Packing Algorithms
- Computing the Minimum Fill-In is NP-Complete
- Title not available (Why is that?)
- Two-dimensional packing with conflicts
- An analytical model for the container loading problem
- An introduction to timetabling
- An exact method for graph coloring
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- An approximation scheme for bin packing with conflicts
- Approximation algorithms for time constrained scheduling
- A new constraint programming approach for the orthogonal packing problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- A hybrid algorithm for constrained order packing
- Bin Packing Problem with Time Lags
- Algorithms for the two dimensional bin packing problem with partial conflicts
- On the benchmark instances for the bin packing problem with conflicts
- The min-conflict packing problem
- Bin packing with directed stackability conflicts
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Bin packing problem with conflicts and item fragmentation
Uses Software
This page was built for publication: Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761944)
