Benchmarking ordering techniques for nonserial dynamic programming

Details Benchmarking ordering techniques for nonserial dynamic programming Benchmarking ordering techniques for nonserial dynamic programming

2011-07-10

arxiv.org/abs/1107.1893v2

Computer Science

Discrete Mathematics

10 pages, 2 figures

Scientific paper

Five ordering algorithms for the nonserial dynamic programming algorithm for solving sparse discrete optimization problems are compared in this paper. The benchmarking reveals that the ordering of the variables has a significant impact on the run-time of these algorithms. In addition, it is shown that different orderings are most effective for different classes of problems. Finally, it is shown that, amongst the algorithms considered here, heuristics based on maximum cardinality search and minimum fill-in perform best for solving the discrete optimization problems considered in this paper.

Affiliated with

Also associated with

No associations

Rating

Benchmarking ordering techniques for nonserial dynamic programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Benchmarking ordering techniques for nonserial dynamic programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Benchmarking ordering techniques for nonserial dynamic programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-136986