A Graphical Approach to Solve Combinatorial Problems: Algorithms and Some Computational Results

What is it about?

This conference paper presents a modification of standard dynamic programming, called a graphical algorithm. Such an algorithm may improve the complexity of a standard dynamic programming algorithm and often also substantially the running time. The approach and some computational results are given for some single machine scheduling problems.

Featured Image

Why is it important?

Such a graphical algorithm can also solve large-scale instances and instances, where the parameters are not integer.