Benchmarking ordering techniques for nonserial dynamic programming

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-136986

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.