An approximation scheme for bin packing with conflicts
From MaRDI portal
Publication:1970333
DOI10.1023/A:1009871302966zbMath0971.90072OpenAlexW1847958188MaRDI QIDQ1970333
Publication date: 6 November 2001
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009871302966
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Combinatorial aspects of packing and covering (05B40)
Related Items (35)
Algorithms for the two dimensional bin packing problem with partial conflicts ⋮ An APTAS for bin packing with clique-graph conflicts ⋮ Scheduling with conflicts: Online and offline algorithms ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ Models and complexity of multibin packing problems ⋮ Batched bin packing revisited ⋮ The maximum flow problem with disjunctive constraints ⋮ Bin packing with ``largest in bottom constraint: tighter bounds and generalizations ⋮ A threshold search based memetic algorithm for the disjunctively constrained knapsack problem ⋮ Parameterized complexity of conflict-free matchings and paths ⋮ A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation ⋮ VNS matheuristic for a bin packing problem with a color constraint ⋮ Minimum cost flow problem with conflicts ⋮ Responsive strategic oscillation for solving the disjunctively constrained knapsack problem ⋮ Security-aware database migration planning ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem ⋮ Online variable-sized bin packing with conflicts ⋮ Paths, trees and matchings under disjunctive constraints ⋮ The table placement problem: a research challenge at the EWI 2007 ⋮ Unnamed Item ⋮ Two-dimensional packing with conflicts ⋮ A survey on vertex coloring problems ⋮ Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts ⋮ Heuristics and lower bounds for the bin packing problem with conflicts ⋮ Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm ⋮ On the minimum clique partitioning problem on weighted chordal graphs ⋮ Unnamed Item ⋮ Bin packing problem with conflicts and item fragmentation ⋮ The vehicle routing problem with heterogeneous locker boxes ⋮ Robustly assigning unstable items ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ Approximation of a batch consolidation problem ⋮ Bin packing with directed stackability conflicts ⋮ Online results for black and white bin packing
This page was built for publication: An approximation scheme for bin packing with conflicts
