Generalized sequencing problem “Towers of Hanoi”

DOI10.1007/BF01920493zbMath0558.90042OpenAlexW2019073353MaRDI QIDQ3347606

Jürgen Bendisch

Publication date: 1985

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01920493

zbMATH Keywords

transportation gameTowers of Hanoigeneralized sequencingminimum partitions

Mathematics Subject Classification ID

Game theory (91A99) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Discussion and correspondence: A note on the Towers of Hanoi problem

This page was built for publication: Generalized sequencing problem “Towers of Hanoi”