Algorithms for knapsack problems
S Martello, P Toth - North-Holland Mathematics Studies, 1987 - Elsevier
Publisher Summary This chapter presents a great variety of practical problems that are
represented by a set of entities, each having an associated value, from which one or more …
represented by a set of entities, each having an associated value, from which one or more …
[图书][B] Knapsack problems: algorithms and computer implementations
S Martello, P Toth - 1990 - dl.acm.org
Knapsack problems: algorithms and computer implementations | Guide books skip to main
content ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse …
content ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse …
[图书][B] Dynamic programming: models and applications
EV Denardo - 2012 - books.google.com
Designed both for those who seek an acquaintance with dynamic programming and for
those wishing to become experts, this text is accessible to anyone who's taken a course in …
those wishing to become experts, this text is accessible to anyone who's taken a course in …
A binary moth search algorithm based on self-learning for multidimensional knapsack problems
A key issue for moth search algorithm (MS) is the ability to maintain sufficient diversity in the
population so as to be able to track a dynamically changing landscape. However, for the …
population so as to be able to track a dynamically changing landscape. However, for the …
[图书][B] Cutting and packing in production and distribution: A typology and bibliography
H Dyckhoff, U Finke - 1992 - books.google.com
1 Introduction.-1.1. Purpose of the Investigation.-1.2. Methodology Used.-1.3. Structure of the
Book.-2 Cutting and Packing Problems as Geometric-Combinatoric Problems.-2.1. Basic …
Book.-2 Cutting and Packing Problems as Geometric-Combinatoric Problems.-2.1. Basic …
Heuristic methods and applications: a categorized survey
SH Zanakis, JR Evans, AA Vazacopoulos - European Journal of …, 1989 - Elsevier
An extensive search of journal publications on heuristic methods and applications produced
442 articles published in 37 journals during the last sixteen years. A scheme is employed to …
442 articles published in 37 journals during the last sixteen years. A scheme is employed to …
Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem
M Chih - Applied Soft Computing, 2015 - Elsevier
The multidimensional knapsack problem (MKP) is a combinatorial optimization problem
belonging to the class of NP-hard problems. This study proposes a novel self-adaptive …
belonging to the class of NP-hard problems. This study proposes a novel self-adaptive …
Heuristic solutions for the multiple-choice multi-dimension knapsack problem
MM Akbar, EG Manning, GC Shoja, S Khan - … , CA, USA, May 28—30, 2001 …, 2001 - Springer
Abstract The Multiple-Choice Multi-Dimension Knapsack Problem (MMKP) is a variant of the
0-1 Knapsack Problem, an NP-Hard problem. Hence algorithms for finding the exact solution …
0-1 Knapsack Problem, an NP-Hard problem. Hence algorithms for finding the exact solution …
New greedy-like heuristics for the multidimensional 0-1 knapsack problem
R Loulou, E Michaelides - Operations Research, 1979 - pubsonline.informs.org
In this paper, we develop four heuristic methods to obtain approximate solutions to the
multidimensional 0-1 knapsack problem. The four methods are tested on a number of …
multidimensional 0-1 knapsack problem. The four methods are tested on a number of …
A hybrid approach to discrete mathematical programming
RE Marsten, TL Morin - Mathematical programming, 1978 - Springer
The dynamic programming and branch-and-bound approaches are combined to produce a
hybrid algorithm for separable discrete mathematical programs. Linear programming is used …
hybrid algorithm for separable discrete mathematical programs. Linear programming is used …