Zobrazeno 1 - 10
of 838
pro vyhledávání: '"Change-making problem"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Theoretical Computer Science. 786:88-95
In this paper, we address an online knapsack problem under concave function f(x), i.e., an item with size x has its profit f(x). We first obtain a simple lower bound \(\max \{q, \frac{f'(0)}{f(1)}\}\), where \(q \approx 1.618\), then show that this b
Autor:
Quang Vu
Publikováno v:
Undergraduate Journal of Mathematical Modeling: One + Two, Vol 11, Iss 1, p 5 (2020)
The classical problem “Coin change” in Computer Science has become a key problem to a number of subsequent problems in different areas: finance, algorithm study, sports, etc. Mathematicians have been paying attention to only two possible outcomes
Publikováno v:
TecnoLógicas, Volume: 22, Issue: spe, Pages: 20-3, Published: DEC 2019
TecnoLógicas, Vol 22, Pp 1-18 (2019)
TecnoLógicas, Vol 22, Pp 1-18 (2019)
Resumen El concreto u hormigón es uno de los materiales más versátiles usados en la construcción. En la actualidad, se usa extensivamente en la industria, ya que puede ser moldeado de formas casi arbitrarias a través de moldes rígidos denominad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13fc617d5fd1b2a0f778edb2b65338d4
http://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0123-77992019000400003&lng=en&tlng=en
http://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0123-77992019000400003&lng=en&tlng=en
Autor:
Javad Tayyebi, Massoud Aman
Publikováno v:
Discrete Applied Mathematics. 240:92-101
Given a linear programming problem with the objective function coefficients vector c and a feasible solution x 0 to this problem, a corresponding inverse linear programming problem is to modify the vector c as little as possible to make x 0 form an o
Publikováno v:
International Journal of Production Economics. 193:12-20
This paper considers a generalization of the precedence-constrained knapsack problem known as multi-period precedence-constrained knapsack, in which the decision maker faces a horizon of several periods. Associated with each period is a capacity limi
Autor:
Markus Lohrey, Georg Zetzsche
Publikováno v:
Theory of Computing Systems. 62:192-246
It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for every graph group. This result even holds if the group elements are represented in a compressed form by s
Publikováno v:
European Journal of Operational Research. 260:56-69
We consider the 0/1 Collapsing Knapsack Problem (CKP) and a generalization involving more than a capacity constraint (M-CKP). We propose a novel ILP formulation and a problem reduction procedure together with an exact approach. The proposed approach
Publikováno v:
Journal of Global Optimization. 69:713-725
We introduce a variant of the knapsack problem, in which the weights of items are also variables but must satisfy a system of linear constraints, and the capacity of knapsack is given and known. We discuss two models: (1) the value of each item is gi