Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in
Help

Publication:2715973: Difference between revisions

From MaRDI portal
Publication:2715973
Jump to:navigation, search

Import240129110113 (talk | contribs)

1 user groups
bot
7,163,963 edits
|
VisualWikitext
Latest revision as of 11:05, 3 February 2024 view source
Import240129110113 (talk | contribs)
Bots
7,163,963 edits
Created automatically from import240129110113
 
(No difference)

Latest revision as of 11:05, 3 February 2024

zbMATH Open1064.05146MaRDI QIDQ2715973FDOQ2715973

Bill Sands, J. Ginsburg

Publication date: 20 July 2005

Published in: Ars Combinatoria (Search for Journal in Brave)




zbMATH Keywords

integer partitioncake cuttingminimum number of cutsceleryknife


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial aspects of partitions of integers (05A17) Extremal combinatorics (05D99)



Cited In (2)

  • Chop vectors and the lattice of integer partitions
  • An algorithm for the determination of optimal cutting patterns






This page was built for publication: An optimal algorithm for a parallel cutting problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2715973)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2715973&oldid=15565193"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 11:05. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki