Optimization_Problems_Recap

Optimization_Problems_Recap - Assume we have an array r of...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
Initialize the matrix c to all zeros. Assume we have an array r of request records. for d=1 to n+1 for i=0 to n-d+1 j=i+d if (r[i].f<=r[j].s) for k=i+1 to j-1 if ( ((r[i].f<=r[k].s) (r[k].f<=r[j].s) ) (c[i,k]+1+c[k,j]>c[i,j]) ) then c[i,j]= c[i,k]+1+c[k,j];
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Initialize the matrix c to all zeros.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Assume we have an array r of request records. for d=1 to n+1 for i=0 to n-d+1 j=i+d if (r[i].f&lt;=r[j].s) for k=i+1 to j-1 if ( ((r[i].f&lt;=r[k].s) &amp;&amp; (r[k].f&lt;=r[j].s) ) &amp;&amp; (c[i,k]+1+c[k,j]&gt;c[i,j]) ) then c[i,j]= c[i,k]+1+c[k,j];...
View Full Document

Page1 / 10

Optimization_Problems_Recap - Assume we have an array r of...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online