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 20 of 46 for “"Knapsack problems"”.

  1. Knapsack Problems with Side Constraints

    … a specific class of resource allocation problems in Combinatorial Optimization: the Knapsack Problems. These are paradigmatic NP-hard problems where a set of items with given profits and weights is available. The aim is to select a subset of the items in order to maximize the total profit …

    poli-torino Repository record for Knapsack Problems with Side Constraints (opens in a new tab)

  2. Knapsack Problems; Methods, Models and Applications

    Knapsack problem (KP) has broad applications in different fields such as machine scheduling, space allocation, and asset optimization. Meanwhile, it is a hard problem due to its computational complexity, but numerous solution approaches have been developed for a variety of KP. In this dissertation, …

    oklahoma-thes Repository record for Knapsack Problems; Methods, Models and Applications (opens in a new tab)

  3. Knapsack Problems; Methods, Models and Applications

    Knapsack problem (KP) has broad applications in different fields such as machine scheduling, space allocation, and asset optimization. Meanwhile, it is a hard problem due to its computational complexity, but numerous solution approaches have been developed for a variety of KP. In this dissertation, …

    oklahoma-thes Repository record for Knapsack Problems; Methods, Models and Applications (opens in a new tab)

  4. On not searching for the multiplier in knapsack problems

    Includes bibliographical references.

    colo-mines Repository record for On not searching for the multiplier in knapsack problems (opens in a new tab)

  5. New Heuristics For The 0-1 Multi-dimensional Knapsack Problems

    … heuristic methods for the 0-1 multi-dimensional knapsack problem (0-1 MKP). 0-1 MKP can be informally stated as the problem of packing items into a knapsack while staying within the limits of different constraints (dimensions). Each item has a profit level assigned to it. They can be, for …

    ucf Repository record for New Heuristics For The 0-1 Multi-dimensional Knapsack Problems (opens in a new tab)

  6. Dynamic-programming approaches to single-and multi-stage stochastic knapsack problems for portfolio optimization

    … single-stage and multi-stage integer stochastic knapsack problems. These problems model stochastic portfolio optimization problems (SPOPs) which assume deterministic unit weight, and normally distributed unit return with known mean and variance for each item type. Given an initial wealth, the …

    nps Repository record for Dynamic-programming approaches to single-and multi-stage stochastic knapsack problems for portfolio optimization (opens in a new tab)

  7. Solution techniques for bi-level knapsack problems and application in allocation of healthcare funds problem

    … BLPP, referred to as Donor-Recipient Bi-level Knapsack Problem (DR-BKP) in our work, the donor has choice to subsidize healthcare projects that are implemented by the recipient country and the country has choice to take these subsidies for project selection using the further funding. There is a …

    strathclyde Repository record for Solution techniques for bi-level knapsack problems and application in allocation of healthcare funds problem (opens in a new tab)

  8. A proposal for an improved version of EigenAnt algorithm with performance evaluation on combinatorial optimization problems

    … algorithm applied to N-node Binary Chain Problems is carried out. Motivated by this analysis, an improved EigenAnt algorithm is proposed, in which the exploration of different stable equilibria and speed of convergence to them can be tuned separately. A comparative analysis of Improved …

    brazil-uerj Repository record for A proposal for an improved version of EigenAnt algorithm with performance evaluation on combinatorial optimization problems (opens in a new tab)

  9. Convex Hull Characterization of Special Polytopes in n-ary Variables

    … base-n expansions, and the solving of n-ary knapsack problems with weakly super-decreasing coefficients.

    clemson Repository record for Convex Hull Characterization of Special Polytopes in n-ary Variables (opens in a new tab)

  10. Theory and Applications of Mixed-Integer Fractional Programming

    … practical results for a class of mixed-integer problems with fractional objectives. We introduce the generalized clique relaxation models with fractional objectives, namely the maximum ratio s-plex problem and the maximum ratio s-defective clique problem. We establish complexity results, …

    tamu Repository record for Theory and Applications of Mixed-Integer Fractional Programming (opens in a new tab)

  11. A Branch-and-Price Algorithm for Bin Packing Problem

    … determination of the k-best solutions of knapsack problem at level kth of the tree. Instead, we present a new approach to deal with the pricing sub-problem of column generation which handles two-dimensional knapsack problems. Furthermore, a set of new upper bounds for Bin Packing Problem …

    york Repository record for A Branch-and-Price Algorithm for Bin Packing Problem (opens in a new tab)

  12. Bio-Inspired Computing for Chance-Constrained Combinatorial Optimisation Problems

    … widely used to solve stochastic optimisation problems, and they can find high-quality solutions. Motivated by real-world applications such as mining engineering problems where constraint violations have distributive effects, we discuss using chance-constrained optimisation to solve …

    adelaide Repository record for Bio-Inspired Computing for Chance-Constrained Combinatorial Optimisation Problems (opens in a new tab)

  13. Allocating Homeland Security Screening Resources Using Knapsack Problem Models

    … using discrete optimization models, specifically knapsack problems. The focus of the maritime chapters involves a risk-based approach for prescreening intelligence classifications for primary and secondary screening decisions given limited budget and resources. Results reveal that screening …

    vcu Repository record for Allocating Homeland Security Screening Resources Using Knapsack Problem Models (opens in a new tab)

  14. A SEMI-DEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR BINARY INTEGER QUADRATIC PROBLEMS USING SCIPSUITE

    … Problem (MIS) as well as the Exact k-Quadratic Knapsack Problems (EkQKP). This thesis focuses on a branch-and-bound algorithm using the SCIP-SDP framework, a leading non-commercial branch-and-bound software using the SDPA solver to solve the semidefinite programming relaxation problem of each …

    nus Repository record for A SEMI-DEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR BINARY INTEGER QUADRATIC PROBLEMS USING SCIPSUITE (opens in a new tab) Download file for A SEMI-DEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR BINARY INTEGER QUADRATIC PROBLEMS USING SCIPSUITE (opens in a new tab)

  15. Heuristic algorithms for solving a class of multiobjective zero-one programming problems

    … zero-one integer linear programming problems. We present some useful concepts and propose some heuristic methods for finding the epsilon-nondominated solutions. The proposed method decomposes a multiobjective zero-one programming problem into a series of single objective problems. …

    nus Repository record for Heuristic algorithms for solving a class of multiobjective zero-one programming problems (opens in a new tab) Download file for Heuristic algorithms for solving a class of multiobjective zero-one programming problems (opens in a new tab)

  16. Advances in Large-Scale Security-Constrained Economic Dispatch: Loss Modeling, Stochastic Dispatch, and Proxy Verification

    … optimization techniques for large-scale SCED problems that improve computational tractability and solution quality for modern power systems. Chapter 1 introduces a novel linear model for line loss outer approximation (LLOA) in DC optimal power flow, a critical component of SCED that models …

    gatech Repository record for Advances in Large-Scale Security-Constrained Economic Dispatch: Loss Modeling, Stochastic Dispatch, and Proxy Verification (opens in a new tab)

  17. Subadditive Approaches to Mixed Integer Programming

    … for solving pure integer linear programming problems are studied. These algorithms rely on Gomory's corner relaxation and subadditive duality. Examples are given to demonstrate the failure of these algorithms on specific IPs and ways of correcting errors in some cases are given. Klabjan's …

    carleton Repository record for Subadditive Approaches to Mixed Integer Programming (opens in a new tab)

Page 1 of 3