Stochastic Heuristics for Knapsack Problems

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F18%3APU128639" target="_blank" >RIV/00216305:26210/18:PU128639 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-319-97888-8_1" target="_blank" >http://dx.doi.org/10.1007/978-3-319-97888-8_1</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-97888-8_1" target="_blank" >10.1007/978-3-319-97888-8_1</a>

Result language

angličtina

Original language name

Stochastic Heuristics for Knapsack Problems

Original language description

In this paper, we introduce knapsack problem formulations, discuss their time complexity and propose their representation and solution based on the instance size. First, deterministic methods are briefly summarized. They can be applied to small-size tasks with a single constraint. However, because of NP-completeness of the problem, more complex problem instances must be solved by means of heuristic techniques to achieve an approximation of the exact solution in a reasonable amount of time. The problem representations and parameter settings for a genetic algorithm and simulated annealing frameworks are shown.

Czech name

—

Czech description

—

Type

J_SC - Article in a specialist periodical, which is included in the SCOPUS database

CEP classification

—

OECD FORD branch

10102 - Applied mathematics

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2018

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Advances in Intelligent Systems and Computing

ISSN

2194-5357

e-ISSN

—

Volume of the periodical

837

Issue of the periodical within the volume

1

Country of publishing house

CH - SWITZERLAND

Number of pages

10

Pages from-to

157-166

UT code for WoS article

—

EID of the result in the Scopus database

2-s2.0-85051831883