%PDF-1.5 % 1 0 obj << /S /GoTo /D (section.1) >> endobj 4 0 obj (Introduction) endobj 5 0 obj << /S /GoTo /D (section.2) >> endobj 8 0 obj (Alternative formulations for the LS-CS problem) endobj 9 0 obj << /S /GoTo /D (section.3) >> endobj 12 0 obj (Dantzig\205Wolfe decomposition and column generation) endobj 13 0 obj << /S /GoTo /D (section.4) >> endobj 16 0 obj (The progressive selection method for the LS-CS problem) endobj 17 0 obj << /S /GoTo /D (section.5) >> endobj 20 0 obj (Further discussion of the PS method for the LS-CS problem) endobj 21 0 obj << /S /GoTo /D (subsection.5.1) >> endobj 24 0 obj (Progressive selection) endobj 25 0 obj << /S /GoTo /D (subsection.5.2) >> endobj 28 0 obj (The upper bounding technique) endobj 29 0 obj << /S /GoTo /D (section.6) >> endobj 32 0 obj (Statistical analyses of the PS method for the LS-CS problem) endobj 33 0 obj << /S /GoTo /D (section.7) >> endobj 36 0 obj (Computational tests) endobj 37 0 obj << /S /GoTo /D (subsection.7.1) >> endobj 40 0 obj (Lower bounds) endobj 41 0 obj << /S /GoTo /D (subsection.7.2) >> endobj 44 0 obj (Preliminary tests for parameter settings) endobj 45 0 obj << /S /GoTo /D (subsection.7.3) >> endobj 48 0 obj (Comparison with other methods for SetA and SetB) endobj 49 0 obj << /S /GoTo /D (subsection.7.4) >> endobj 52 0 obj (Comparison with other methods for harder problems) endobj 53 0 obj << /S /GoTo /D (section.8) >> endobj 56 0 obj (Conclusions and future research) endobj 57 0 obj << /S /GoTo /D [58 0 R /Fit] >> endobj 60 0 obj << /Length 2334 /Filter /FlateDecode >> stream xڅXYs6~ׯUaHgbNJT%DBCD<<ȿ~"gFy@__7z{/^ۋo /%w{I