General layouting algorithm

[m4drat]

Potential solution - 1

1. Can be formulated in terms of discrete knapsack w/o repetitions:
2. Item value: number of outgoing pointers / ingoing pointers. "Weight": size of the memory cell.
3. Knapsack capacity: one memory page

Potential solution - 2

1. Greedy approach.

Things to note

1. Base virtual class for all heuristics
2. Tagging system (What type of data structure)

Resources:

1. Algorithms for knapsack problem
2. Multiple Constraint Knapsack Problem