Add to ORKG[No Abstract Available]Minist Transport Commun & High Technologies Republic Azerbaijan, Baku State Univ, Inst Appl Mat
∗ corresponding author In this paper, we present an approach, based on dynamic programming, for solv...
Abstract: The 0/1 knapsack (or knapsack without repetition) has a dynamic programming solution driv...
In this paper, we present an approach, based on dynamic programming, for solving the 0–1 multi-objec...
International audienceThis paper presents a preprocessing procedure for the 0–1 multidimensional kna...
International audienceThis paper presents a preprocessing procedure for the 0–1 multidimensional kna...
International audienceThis paper presents a preprocessing procedure for the 0–1 multidimensional kna...
International audienceThis paper presents a preprocessing procedure for the 0–1 multidimensional kna...
Soumis a la revue Journal of Parallel and Distributed ComputersSIGLEAvailable at INIST (FR), Documen...
This article presents an exact cooperative method for the solution of the multidimensional knapsack ...
In the study are described integer programming, particular problems, as assignment problem, cover pr...
We study the multidimensional knapsack problem, present some theoretical and empirical results about...
The Bilevel Knapsack Problem (BKP) is a hierarchical optimization problem in which the fea...
This work deals with multi-dimensional knapsack problem. Knapsack problem coincides with the categor...
The paper presents a new reformulation approach to reduce the complexity of a branch and bound algor...
Vita.In this dissertation, an algorithm was developed to solve large scale discrete nonlinear knapsa...
∗ corresponding author In this paper, we present an approach, based on dynamic programming, for solv...
Abstract: The 0/1 knapsack (or knapsack without repetition) has a dynamic programming solution driv...
In this paper, we present an approach, based on dynamic programming, for solving the 0–1 multi-objec...
International audienceThis paper presents a preprocessing procedure for the 0–1 multidimensional kna...
International audienceThis paper presents a preprocessing procedure for the 0–1 multidimensional kna...
International audienceThis paper presents a preprocessing procedure for the 0–1 multidimensional kna...
International audienceThis paper presents a preprocessing procedure for the 0–1 multidimensional kna...
Soumis a la revue Journal of Parallel and Distributed ComputersSIGLEAvailable at INIST (FR), Documen...
This article presents an exact cooperative method for the solution of the multidimensional knapsack ...
In the study are described integer programming, particular problems, as assignment problem, cover pr...
We study the multidimensional knapsack problem, present some theoretical and empirical results about...
The Bilevel Knapsack Problem (BKP) is a hierarchical optimization problem in which the fea...
This work deals with multi-dimensional knapsack problem. Knapsack problem coincides with the categor...
The paper presents a new reformulation approach to reduce the complexity of a branch and bound algor...
Vita.In this dissertation, an algorithm was developed to solve large scale discrete nonlinear knapsa...
∗ corresponding author In this paper, we present an approach, based on dynamic programming, for solv...
Abstract: The 0/1 knapsack (or knapsack without repetition) has a dynamic programming solution driv...
In this paper, we present an approach, based on dynamic programming, for solving the 0–1 multi-objec...