Suggested Topics within your search.
Suggested Topics within your search.
Building construction & materials
2
Computer science
2
0-1 knapsack problem
1
Budget control
1
Budgeted maximum coverage problem
1
Budgeted maximum coverage problems
1
Combinatorial optimization
1
Costs
1
Distributed systems
1
Effective variables
1
History of engineering and technology
1
Iterative methods
1
Local search
1
Local search (optimization)
1
Local search algorithm
1
Markov chain
1
Neighbor structures
1
Neighbour structure
1
Non negatives
1
QA75 Electronic computers. Computer science
1
Set cover problem
1
Set theory
1
Structural optimization
1
TA Engineering (General). Civil engineering (General)
1
TH Building construction
1
Technology: general issues
1
Variable depth
1
Variable depth local search
1
animal experiment
1
article
1
-
301“... the algorithm that similar to sovle a knapsack problem. The proposed heuristic allocates internet ads item...”
Get full text
Others -
302“.... After integrating those two above, select the best risk treatment strategy with Knapsack problem form. ...”
Get full text
Others -
303“... as a 0-1 multiple knapsack problem (0-1 MKP) which is a NP-hard problem but the constraint of our...”
Get full text
Others -
304On the Development of a Computer-Assisted Testing System with Genetic Test Sheet-Generating Approach“... knapsack problem, which is known to be NP-hard in the literature, computational challenge hinders...”
Get full text
Others -
305“... and Sexual GA are applied to three optimization problems such as Traveling Salesman Problem, 0-1 Knapsack...”
Get full text
Others -
306“... knapsack problem. Based on ACO algorithm, our thesis proposes a deployment strategy to improve the network...”
Get full text
Others -
307“... between alternatives. The model is formulated as a knapsack problem which is characterized as an NP...”
Get full text
Others -
308“..., respectively. Finally, we use the Knapsack Problem Algorithm (KPA) to infer the optimum food collocation...”
Get full text
Others -
309by Medeiros, Carlos Antonio de“... to a knapsack problem is identified by dynamic programming or a heuristic procedure. In the second...”
Published 1996
Get full text
Others -
310“... resources under a certain cost of emergency investment. We built an improved solution of a multiple knapsack...”
Get full text
Article -
311by İhsan Yanıkoğlu“... knapsack problem. Then, we compare optimality and computational performances of the safe approximation...”
Published 2019-07-01
Get full text
Article -
312
-
313by Barreto, Arthur Medeiros Figueiredo.“... solution for the linear relaxation of the problem. The column generation uses the knapsack problem...”
Published 2019
Get full text
Others -
314by Roberto Gomes Ribeiro“... to a new formulation based on the knapsack problem, aiming to aid decision making in problems...”
Published 2013
Get full text
Others -
315“... the optimal path among adjacent clusters as a local routing (LR), and builds the Multi-choice Knapsack Problem...”
Get full text
Article -
316“... problem (TUMP). This article transforms the TUMP into a precedence constraint knapsack problem, which is a...”
Get full text
Article -
317“... binary knapsack problem, where all the corresponding constraints are replaced by the power index...”
Get full text
Article -
318“... to determine the amount of irrigation water required to optimize water use. To achieve this idea, the “knapsack...”
Get full text
Article -
319“... routing problem (VRP), the continuous review policy for inventory management, the knapsack problem...”
Get full text
Article -
320“... index capacity, it is shown that this optimization problem can be converted into a binary knapsack...”
Get full text
Article