Polytopes, permutation shapes and bin packing

DOI10.1016/S0196-8858(02)00526-2zbMath1023.68112MaRDI QIDQ1398288

Marguerite A. Eisenstein-Taylor

Publication date: 29 July 2003

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

bin packing problemNEXT FIT algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

David-Barton type identities and alternating run polynomials ⋮ Eulerian pairs and Eulerian recurrence systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two poset polytopes
• Enumeration of pairs of sequences by rises, falls and levels
• Stirling polynomials
• On a dual version of the one-dimensional bin packing problem
• A Coloring Problem

This page was built for publication: Polytopes, permutation shapes and bin packing