Zobrazeno 1 - 10
of 1 627
pro vyhledávání: '"Continuous knapsack problem"'
Autor:
Sergey Kovalev
Publikováno v:
4OR. 20:209-216
Malaguti et al. introduce (Eur J Oper Res 273:874–888, 2019) the Fractional Knapsack Problem with Penalties, which is similar to the classical 0-1 Knapsack problem, except that each of the n variables associated with one of the n items can take any
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ce0e2764017101e2178a42d6b170767
https://doi.org/10.1007/s10288-021-00474-1
https://doi.org/10.1007/s10288-021-00474-1
Publikováno v:
Journal of the Operations Research Society of China. 9:713-721
We address a variant of the continuous knapsack problem, where capacities regarding costs of items are given into account. We prove that the problem is NP-complete although the classical continuous knapsack problem is solvable in linear time. For the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c94ecaa7cf8eecc67a596e9d9fba4a85
https://doi.org/10.1007/s40305-020-00298-6
https://doi.org/10.1007/s40305-020-00298-6
Autor:
Christos Pelekis, Panagiotis Promponas, Juan Alvarado, Eirini Eleni Tsiropoulou, Symeon Papavassiliou
A Fragile CPR Game is an instance of a resource sharing game where a common-pool resource, which is prone to failure due to overuse, is shared among several players. Each player has a fixed initial endowment and is faced with the task of investing in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a08b2de292bc0a1e962040fb89bef0be
https://lirias.kuleuven.be/handle/20.500.12942/706807
https://lirias.kuleuven.be/handle/20.500.12942/706807
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68533785611d92549067a4bb2b22b331
https://doi.org/10.1016/j.tcs.2018.03.025
https://doi.org/10.1016/j.tcs.2018.03.025
Publikováno v:
Jurnal Teknologi dan Sistem Komputer. 7:71-76
The technical problems faced in e-government implemented by the Ministry of Religion of Indonesia since 2015 are minimal bandwidth requirements to provide information services and behavior of users who access entertainment sites. When peak hours occu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38705acfa026ffbb9251baae7d54efc5
https://doi.org/10.14710/jtsiskom.7.2.2019.71-76
https://doi.org/10.14710/jtsiskom.7.2.2019.71-76
Publikováno v:
European Journal of Operational Research. 273:874-888
We consider integer optimization problems where variables can potentially take fractional values, but this occurrence is penalized in the objective function. This general situation has relevant examples in scheduling (preemption), routing (split deli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0aadbf01dd77c73a89f4a7bcf99ebbec
https://doi.org/10.1016/j.ejor.2018.09.020
https://doi.org/10.1016/j.ejor.2018.09.020
A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
Publikováno v:
Asia-Pacific Journal of Operational Research. 38
We consider two variants of a time–cost tradeoff problem with multiple assessments on a chain precedence graph. Furthermore, each job can only be started after a release time, and a penalty cost is incurred when a job is not finished before its due
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75def0164be98c8de0866761ac72269d
https://doi.org/10.1142/s0217595921500123
https://doi.org/10.1142/s0217595921500123
Autor:
Stefan M. Stefanov
A separable convex continuous knapsack problem with a single equality constraint and bounded variables is considered in this paper. Necessary and sufficient condition (characterization) for a feasi...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf3c496f671f1af16b1803599396dddb
Publikováno v:
Omega. 81:169-182
The open pit mine production scheduling problem (OPMPSP) consists of scheduling the extraction of a mineral deposit that is broken into a number of smaller segments, or blocks, such that the net present value (NPV) of the operation is maximised. This
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ce6aba1e563d1dce783d0921089f9c6
https://doi.org/10.1016/j.omega.2017.10.008
https://doi.org/10.1016/j.omega.2017.10.008
Publikováno v:
Operations Research Letters. 46:487-491
In this paper, we investigate the parametric weight knapsack problem, in which the item weights are affine functions of the form w i ( λ ) = a i + λ ⋅ b i for i ∈ { 1 , … , n } depending on a real-valued parameter λ . The aim is to provide a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06e1bc10dafeeac030b300ddd59f3030
https://doi.org/10.1016/j.orl.2018.07.005
https://doi.org/10.1016/j.orl.2018.07.005