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 11 of 11 for “"Multi-dimensional knapsack problem"”.

  1. Dynamic allocation of fires and sensors

    … calls an optimization package that solves a multi-dimensional knapsack problem to allocate assets based on the current conditions. Once the simulation is complete the model generates XML output that is subsequently processed by an analysis package. The model goes beyond normal implementations …

    nps Repository record for Dynamic allocation of fires and sensors (opens in a new tab)

  2. Adapting the Dynamic Allocation of Fires and Sensors (DAFS) model for use in maritime combat analysis

    … package to allocate weapons based on a multi-dimensional knapsack problem simulating a networked force. Upon completion of the simulation run, the model generates an XML output that can be later read for statistical analysis and data mining. Because of the stochastic nature of the model, …

    nps Repository record for Adapting the Dynamic Allocation of Fires and Sensors (DAFS) model for use in maritime combat analysis (opens in a new tab)

  3. Integrated methods and systems for optimization and decision support

    … components for different optimization problems along with a DSS for each problem as further result. Motivated by the so-called integrated methods for optimization, we study three different optimization problems, and present new algorithms that combine the complementary strengths of the …

    greece Repository record for Integrated methods and systems for optimization and decision support (opens in a new tab)

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

    … introduces new 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 …

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

  5. Multi-stage stochastic optimization and reinforcement learning for forestry epidemic and covid-19 control planning

    … new modeling and solution approaches based on multi-stage stochastic programming and reinforcement learning for tackling biological invasions in forests and human populations. Emerald Ash Borer (EAB) is the nemesis of ash trees. This research introduces a multi-stage stochastic mixed-integer …

    njit Repository record for Multi-stage stochastic optimization and reinforcement learning for forestry epidemic and covid-19 control planning (opens in a new tab)

  6. Defending against inference attack in online social networks

    … formulate the privacy-preserving data sharing problem to defend against the attack. The optimization problem is to maximize the users' self-disclosure utility while preserving their privacy. We propose two privacy-preserving social network data sharing methods to counter the inference attack. …

    uvic Repository record for Defending against inference attack in online social networks (opens in a new tab)

  7. Particle swarm optimization: theoretical analysis, modifications, and applications to constrained optimization problems.

    … to continuous space constrained optimization problems (COPs). We introduced a new aspect in dealing with constrained optimization problems namely locating disjoint feasible regions in a search space. We developed a variant of PSO that was able to locate disjoint feasible regions in a search …

    adelaide Repository record for Particle swarm optimization: theoretical analysis, modifications, and applications to constrained optimization problems. (opens in a new tab)

  8. Integrated machine learning and optimization approaches

    … a broad range of well-known operations research problems to reduce the solution times. The first study presents a bidirectional Long Short-Term Memory framework to learn optimal solutions to sequential decision-making problems. Computational results show that the framework significantly reduces …

    njit Repository record for Integrated machine learning and optimization approaches (opens in a new tab)

  9. Lower bounds for integer programming problems

    Solving real world problems with mixed integer programming (MIP) involves efforts in modeling and efficient algorithms. To solve a minimization MIP problem, a lower bound is needed in a branch-and-bound algorithm to evaluate the quality of a feasible solution and to improve the efficiency of the …

    gatech Repository record for Lower bounds for integer programming problems (opens in a new tab)

  10. FRAMEWORK FOR CUBESATS MISSION MANAGEMENT, DESIGN, AND OPTIMIZATION

    … the database in place, the component selection problem is formulated explicitly, as a multiple-choice-multi dimensional Knapsack Problem, where the goal is to select the components of the CubeSat maximizing its performance but respecting global budgets on mass, power, and volume. External …

    trento Repository record for FRAMEWORK FOR CUBESATS MISSION MANAGEMENT, DESIGN, AND OPTIMIZATION (opens in a new tab) Embargoed

  11. RESOURCE MANAGEMENT FRAMEWORK FOR VOLUNTEER CLOUD COMPUTING

    … in volunteer cloud computing. It presents a multi-state semi-Markov process based model to predict the future availability and reliability of nodes in volunteer cloud systems. A volunteer node is modelled as a semi-Markov process, whose future state depends only on its current state. This …

    siu-theses Repository record for RESOURCE MANAGEMENT FRAMEWORK FOR VOLUNTEER CLOUD COMPUTING (opens in a new tab)