0/1 Knapsack Problem

Michal Mankowski; Mikhail Moshkov

doi:10.1007/978-3-030-63920-4_19

0/1 Knapsack Problem

Michal Mankowski^*, Mikhail Moshkov

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

In this chapter, we design conventional and syntactical circuits for the 0/1 knapsack problem, describe two cost functions for the syntactical circuit, evaluate the number of operations and the time required by the algorithms for the optimization and counting, discuss an example, and show experimental results.

Original language	English (US)
Title of host publication	Studies in Systems, Decision and Control
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	201-210
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-030-63920-4_19
State	Published - 2021

Publication series

Name	Studies in Systems, Decision and Control
Volume	331
ISSN (Print)	2198-4182
ISSN (Electronic)	2198-4190

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.

ASJC Scopus subject areas

Computer Science (miscellaneous)
Control and Systems Engineering
Automotive Engineering
Social Sciences (miscellaneous)
Economics, Econometrics and Finance (miscellaneous)
Control and Optimization
Decision Sciences (miscellaneous)

Access to Document

10.1007/978-3-030-63920-4_19

Cite this

@inbook{c99c247f49be4ae18897302459314e36,

title = "0/1 Knapsack Problem",

abstract = "In this chapter, we design conventional and syntactical circuits for the 0/1 knapsack problem, describe two cost functions for the syntactical circuit, evaluate the number of operations and the time required by the algorithms for the optimization and counting, discuss an example, and show experimental results.",

author = "Michal Mankowski and Mikhail Moshkov",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.",

year = "2021",

doi = "10.1007/978-3-030-63920-4_19",

language = "English (US)",

series = "Studies in Systems, Decision and Control",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "201--210",

booktitle = "Studies in Systems, Decision and Control",

address = "Germany",

}

TY - CHAP

T1 - 0/1 Knapsack Problem

AU - Mankowski, Michal

AU - Moshkov, Mikhail

PY - 2021

Y1 - 2021

N2 - In this chapter, we design conventional and syntactical circuits for the 0/1 knapsack problem, describe two cost functions for the syntactical circuit, evaluate the number of operations and the time required by the algorithms for the optimization and counting, discuss an example, and show experimental results.

AB - In this chapter, we design conventional and syntactical circuits for the 0/1 knapsack problem, describe two cost functions for the syntactical circuit, evaluate the number of operations and the time required by the algorithms for the optimization and counting, discuss an example, and show experimental results.

UR - http://www.scopus.com/inward/record.url?scp=85101392447&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-63920-4_19

DO - 10.1007/978-3-030-63920-4_19

M3 - Chapter

AN - SCOPUS:85101392447

T3 - Studies in Systems, Decision and Control

SP - 201

EP - 210

BT - Studies in Systems, Decision and Control

PB - Springer Science and Business Media Deutschland GmbH

ER -

0/1 Knapsack Problem

Abstract

Publication series

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this