Results 161 to 170 of about 417,011 (184)

Encoding transformation-based differential evolution algorithm for solving knapsack problem with single continuous variable

Swarm and Evolutionary Computation, 2019
The knapsack problem with a single continuous variable (KPC) is an extension of the standard 0–1 knapsack problem. It is an especial combinatorial optimization problem with continuous variable S so that its solution is more difficult.
Yichao He, Jinghong Wang, Xinlu Zhang, Huanzhe Li, Xuejing Liu   +4 more
semanticscholar   +1 more source

A linear-time algorithm for solving continuous maximin knapsack problems

Operations Research Letters, 1991
The paper deals with the linear maximin problem \[ (KP)\text{ maximize } z=\min_{i\in M}\{\sum_{j\in J_ i}c_ jx_ j\} \] subject to \(\sum_{j\in N}a_ jx_ j\leq b\), \(0\leq x_ j\leq 1\), \(j\in N\), where \(M=\{1,...,m\}\), \(N=\{1,...,n\}\), \(J_ p\cap J_ q=\emptyset\), \(p\neq q\), and \(\cup_{i\in M}J_ i\subset N\). An O(n) algorithm for solving (KP)
Takahito Kuno, Hiroshi Konno, Eitan Zemel   +2 more
openaire   +1 more source

A Binary Butterfly Optimization Algorithm for the Multidimensional Knapsack Problem

2020 6th Iranian Conference on Signal Processing and Intelligent Systems (ICSPIS), 2020
The Multidimensional knapsack problem (MKP) is a well-known optimization problem with which many real-world engineering problems can be modeled. Due to its NP-hard nature, exact methods of solving the MKP are limited to small-scale problems.
Amirmohammad Shahbandegan, M. Naderi
semanticscholar   +1 more source

Robust Extensible Bin Packing and Revisiting the Convex Knapsack Problem

arXiv.org
We study a robust extensible bin packing problem with budgeted uncertainty, under a budgeted uncertainty model where item sizes are defined to lie in the intersection of a box with a one-norm ball.
Noam Goldberg, Michael Poss, Yariv N. Marmor   +2 more
semanticscholar   +1 more source

Fixed-charge continuous knapsack problems and pseudogreedy solutions

Mathematical Programming, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A Hybrid Symmetry Strategy Improved Binary Planet Optimization Algorithm with Theoretical Interpretability for the 0-1 Knapsack Problem

Symmetry
The Planet Optimization Algorithm (POA) is a meta-heuristic inspired by celestial mechanics, drawing on Newtonian gravitational principles to simulate planetary dynamics in optimization search spaces.
Yang Yang
semanticscholar   +1 more source

On the complexity of the continuous unbounded knapsack problem with uncertain coefficients

Operations Research Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem

Journal of Optimization Theory and Applications, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem

Journal of Optimization Theory and Applications, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Innovative approximate solution methods and error estimation for the knapsack problem

Informatics and Control Problems
A new innovative approximate solution method of the knapsack problem is developed. First, any approximate solution to the problem is found in the known manner. After that, the process of improving that solution is built successively. Here, a neighborhood
R. R. Niyazova
semanticscholar   +1 more source