Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Inequality Merging"”.

  1. Generating cutting planes through inequality merging on multiple variables in knapsack problems

    … class of cutting planes called multiple variable merging cover inequalities (MVMCI). The thesis presents the multiple variable merging cover algorithm (MVMCA), which runs in linear time and produces a valid MVMCI. Under certain conditions, an MVMCI can be shown to be a facet defining inequality. …

    ksu Repository record for Generating cutting planes through inequality merging on multiple variables in knapsack problems (opens in a new tab)