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 2 of 2 for “"Sequential knapsack"”.

  1. Generalizations, Extensions, and Applications of the Sequential Knapsack Problem

    We consider the Sequential Knapsack Problem (SKP), a special case of the 0-1 Knapsack Problem (KP), where each item size divides the next, without remainder, when arranged from smallest to largest. We present an O(n^2 log n) algorithm that solves SKP and the Bounded Sequential Knapsack Problem …

    buffalo Repository record for Generalizations, Extensions, and Applications of the Sequential Knapsack Problem (opens in a new tab)

  2. Mixed integer bilinear programming with applications to the pooling problem

    Solution methodologies for mixed integer bilinear problems (MIBLP) are studied in this dissertation. This problem class is motivated using the pooling problem, a multicommodity network flow problem that typically arises in chemical engineering applications. Stronger than previously known results …

    gatech Repository record for Mixed integer bilinear programming with applications to the pooling problem (opens in a new tab)