From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
From MaRDI portal
Publication:1736650
DOI10.3390/a8020190zbMath1461.90052OpenAlexW1517858365MaRDI QIDQ1736650
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a8020190
Nonnumerical algorithms (68W05) Permutations, words, matrices (05A05) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- Lattice path counting and the theory of queues
- A history and a survey of lattice path enumeration
- A CAT algorithm for generating permutations with a fixed number of inversions
- The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
- Higher dimensional restricted lattice paths with diagonal steps
- Underdiagonal lattice paths with unrestricted steps
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
- Discrete Mathematics in Voting and Group Choice
- Communication Theory of Secrecy Systems*
- Some Monotonicity Properties of Partial Orders
- Open shop scheduling with delays
- Generating Permutations with Nondistinct Items
- A Note on Multiset Permutations
- Generating Multiset Permutations in Constant Time
- Investigation of block-sorting of multiset permutations
- Scheduling
This page was built for publication: From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
