Algorithms for packing problems
From MaRDI portal
Applications of graph theory (05C90) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- scientific article; zbMATH DE number 3970110
- scientific article; zbMATH DE number 824099
- scientific article; zbMATH DE number 6719727
- Algorithms and complexity for scheduling and packing problems
- An algorithm for packing squares
- Parameterized approximation algorithms for packing problems
- scientific article; zbMATH DE number 3989108
- scientific article; zbMATH DE number 3926962
- scientific article; zbMATH DE number 2196275
Cited in
(6)- An algorithm for packing squares
- Algorithm NextFit for the bin packing problem
- A competitive strategy for distance-aware online shape allocation
- Space defragmentation for packing problems
- scientific article; zbMATH DE number 6719727 (Why is no real title available?)
- Algorithm for the vertex packing problem
This page was built for publication: Algorithms for packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926631)