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
-
41“... multidimensional knapsack benchmarks and several dynamic multidimensional knapsack problems, which have numerous...”
Get full text
Article -
42“... on Multiple Knapsack Problem, which is a real world problem. Benchmark comparisons among the strategies...”
Get full text
Article -
43“... is evaluated to solve the Knapsack Problem, which models different variant of resource allocation problems...”
Get full text
Article -
44
-
45
-
46by Elena Balan“...A class of knapsack problems which generalizes the classical ones is studied. Algorithms based...”
Published 2005-01-01
Get full text
Article -
47
-
48
-
49by SE Visagie“...In this paper the efficient solvability of a class of nonlinear knapsack problems are investigated...”
Published 2008-06-01
Get full text
Article -
50
-
51by Kameshwaran, SSubjects: “...Piecewise Linear Knapsack Problems...”
Published 2011
Get full text
Get full text
-
52“..., it is necessary to study the combinatorial efficiency evaluation problem which can be illustrated as a knapsack...”
Get full text
Article -
53
-
54“... tight upper bounds for the 0-1 Knapsack Problem. Encouraged by their results, we partition the search...”
Get full text
Article -
55
-
56by Krishnan, Bharath Kumar“... approximation algorithm for the cardinality constrained knapsack problem. The algorithm consists of three steps...”
Published 2006
Get full text
Others -
57by MARCIO DE MORAES PALMEIRA“.... === We consider the 0-1 Quadratic Knapsack Problem (QKP), which consists of maximizing a quadratic...”
Published 1999
Get full text
Get full text
-
58
-
59“...In this paper we present the Group Seat Reservation Knapsack Problem with Profit on Seat...”
Get full text
Article -
60“... use the scatter search to solve the multidimensional knapsack problem with generalized upper bound...”
Get full text
Others