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
-
81“...) with greedy strategy is put forward for solving 0-1 knapsack problems. First of all, for solving binary...”
Get full text
Article -
82
-
83“... and transportation question could form as knapsack question models. Knapsack problem is one kind of NP-Complete...”
Get full text
Others -
84“...碩士 === 朝陽科技大學 === 資訊管理系碩士班 === 95 === The Knapsack problem is an NP-Complete problem. Unbounded...”
Get full text
Others -
85“... knapsack problem. Furthermore, the results of experiment are also compared with other heuristic algorithms...”
Get full text
Others -
86“... approach an important issue. Making decisions on budget allocation is a knapsack problem, within...”
Get full text
Others -
87
-
88“... knapsack problem (LMCKP). A dynamic programming is proposed to solve it. Then, the optimal solution...”
Get full text
Others -
89
-
90by Bolton, Thomas Charles“... is the knapsack problem, which has applications including project and portfolio selection, production planning...”
Published 2015
Get full text
-
91
-
92
-
93“...博士 === 國立清華大學 === 工業工程與工程管理學系 === 104 === A 0-1 multidimensional knapsack problem (MKP) aims...”
Get full text
Others -
94Published“...The knapsack problem (KP) is a traditional optimization problem. Its applicability in the real...”
Get full text
-
95by Simms, Amy E.Subjects: “...Knapsack Problem...”
Published 2014
Get full text
Get full text
Others -
96by Hiremath, ChaitrSubjects: “...Multiple-Choice Multidimensional Knapsack Problem...”
Published 2008
Get full text
-
97by Marta Lilia Eraña-Díaz, Marco Antonio Cruz-Chávez, Fredy Juárez-Pérez, Juana Enriquez-Urbano, Rafael Rivera-López, Mario Acosta-Flores“... Problem (MKP). Finally, since Multidimensional Knapsack Problem is NP-hard, one simulated annealing...”
Published 2021-05-01
Get full text
Article -
98
-
99
-
100