Ond-threshold graphs andd-dimensional bin packing
From MaRDI portal
Publication:3157035
DOI10.1002/net.20037zbMath1058.90052OpenAlexW2319631416MaRDI QIDQ3157035
Andrea Lodi, Alberto Caprara, Romeo Rizzi
Publication date: 12 January 2005
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20037
lower boundmaximum matchingcomputational resultsmaximum stable set\(d\)-dimensional bin packingThreshold graph
Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (3)
A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time ⋮ New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem ⋮ Counting and enumerating independent sets with applications to combinatorial optimization problems
Uses Software
Cites Work
This page was built for publication: Ond-threshold graphs andd-dimensional bin packing