Results 71 to 80 of about 5,749 (206)
Reoptimization in lagrangean methods for the quadratic knapsack problem
The 0-1 quadratic knapsack problem consists in maximizing a quadratic function subject to a linear capacity constraint. To solve exactly this problem with a branch and bound algorithm, we need to obtain good lower an upper bounds in order to fix a lot of variables in the pre-treatment phase at the root node of the branch and bound tree if we want to ...
Létocart, Lucas +2 more
openaire +3 more sources
In this work the author propose a deep learning based model for the prediction of the SAR hotspot location and value on a human body exposed to a broadband electromagnetic source generated by a wearable device on the body's back. The deep learning (DL) model is trained on a complex dataset, and it is capable of accurate prediction for operation ...
Shayan Dodge +4 more
wiley +1 more source
Constrained knapsack variants are well-suited for QUBO-based quantum optimization, but adding logical relations can inflate the binary model and complicate penalty selection.
Evren Guney, Joachim Ehrenthal
doaj +1 more source
ABSTRACT Theory, experiments and field studies indicate that the somatic growth rate of freshwater consumers is shaped by the individual, additive and multiplicative effects of multiple factors, including consumer size and condition, temperature, prey resources and biotic interactions.
Peter. M. Kiffney +4 more
wiley +1 more source
Reoptimization in lagrangian methods for the quadratic knapsack problem
International audienceThe 0-1 quadratic knapsack problem consists in maximizing a quadratic objective function subject to a linear capacity constraint. To solve exactly large instances of this problem with a tree search algorithm (e.g. a branch and bound
Létocart, Lucas +2 more
core +1 more source
The review covers diverse control strategies applicable for energy management of distributed energy generation or RESs. Microgrid and distribution network are identified as potential power system networks common for integration of RESs, current state of the methods in terms of application and shortcomings are identified and a proposal of a more robust ...
Obed N. Onsomu +2 more
wiley +1 more source
The ant colony metaphor for multiple knapsack problem
This paper presents an Ant Colony Optimisation (ACO) model for the Multiple Knapsack Problem (MKP). The ACO algorithms, as well as other evolutionary metaphors, are being applied successfully to diverse heavily constrained problems: Travelling Salesman ...
Marcelo Guillermo Cena +3 more
doaj
A blockchain‐based framework to optimize shipping container flows in the hinterland
Abstract We address two interrelated issues affecting the hinterland portion of the maritime container supply chain: reducing the movement of empty containers and reducing empty trips by trucks carrying these containers. In this paper, we show that empty container flow optimization can be implemented via a blockchain based on the proof‐of‐useful‐work ...
Mariem Mhiri +4 more
wiley +1 more source
Algorithms for the solution of quadratic knapsack problems
Let Q be an \(n\times n\) real matrix and let e denote the n-vector of ones. The authors present and analyze three algorithms for minimizing the quadratic form (x,Qx) subject to \((e,x)=1\), \(x\geq 0.\) The first algorithm is an extension of the potential reduction algorithm for linear complementarity problems developed recently by \textit{M. Kojima},
Pardalos, Panos M. +2 more
openaire +1 more source
Functional Data Analysis: An Introduction and Recent Developments
ABSTRACT Functional data analysis (FDA) is a statistical framework that allows for the analysis of curves, images, or functions on higher dimensional domains. The goals of FDA, such as descriptive analyses, classification, and regression, are generally the same as for statistical analyses of scalar‐valued or multivariate data, but FDA brings additional
Jan Gertheiss +3 more
wiley +1 more source

