A Quasi-Polynomial Algorithm for the Knapsack Problem
The Yugoslav Journal of Operations Research (1994)
- Volume: 4, Issue: 8, page 149-157
- ISSN: 0354-0243
Access Full Article
top
How to cite
topValentin E. Brimkov. "A Quasi-Polynomial Algorithm for the Knapsack Problem." The Yugoslav Journal of Operations Research 4.8 (1994): 149-157. <http://eudml.org/doc/261431>.
@article{ValentinE1994,
author = {Valentin E. Brimkov},
journal = {The Yugoslav Journal of Operations Research},
keywords = {number of vertices of the knapsack polytope; pseudopolynomial method},
language = {eng},
number = {8},
pages = {149-157},
publisher = {Faculty of Organizational Sciences},
title = {A Quasi-Polynomial Algorithm for the Knapsack Problem},
url = {http://eudml.org/doc/261431},
volume = {4},
year = {1994},
}
TY - JOUR
AU - Valentin E. Brimkov
TI - A Quasi-Polynomial Algorithm for the Knapsack Problem
JO - The Yugoslav Journal of Operations Research
PY - 1994
PB - Faculty of Organizational Sciences
VL - 4
IS - 8
SP - 149
EP - 157
LA - eng
KW - number of vertices of the knapsack polytope; pseudopolynomial method
UR - http://eudml.org/doc/261431
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.