Polytopes, permutation shapes and bin packing
type: Item
instance of: scholarly article
title: Polytopes, permutation shapes and bin packing
zbMATH Open document ID: 1023.68112
DOI: 10.1016/S0196-8858(02)00526-2
author: Marguerite A. Eisenstein-Taylor
published in: Advances in Applied Mathematics
publication date: 2003-07-29T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 1956060
zbMATH Keywords: bin packing problem
zbMATH Keywords: NEXT FIT algorithm
MaRDI profile type: Publication
cites work: On a dual version of the one-dimensional bin packing problem
cites work: Enumeration of pairs of sequences by rises, falls and levels
cites work: A Coloring Problem
cites work: Stirling polynomials
cites work: Q3669422
cites work: Q3773321
cites work: Q4304433
cites work: Q4344108
cites work: Q4132537
cites work: Two poset polytopes
Recommended article: On permutation polytopes
Recommended article: Q4867143
Recommended article: Geometry, complexity, and combinatorics of permutation polytopes
Recommended article: On Volumes of Permutation Polytopes
Recommended article: Polytopes in arrangements
Recommended article: A problem of packing of homothetic convex polytopes
Recommended article: Packing convex polygons in minimum-perimeter convex hulls
Recommended article: Q3682240
Recommended article: Q4871778
description: scientific article; zbMATH DE number 1956060