Zobrazeno 1 - 10
of 84
pro vyhledávání: '"György Dósa"'
Publikováno v:
Symmetry, Vol 13, Iss 8, p 1539 (2021)
In this paper, we investigate partitions of highly symmetrical discrete structures called cycloids. In general, a mixed hypergraph has two types of hyperedges. The vertices are colored in such a way that each C-edge has two vertices of the same color
Externí odkaz:
https://doaj.org/article/3e3b6d2f80d44234b8d7d1f4db2a841f
Publikováno v:
Mathematics, Vol 9, Iss 13, p 1540 (2021)
Bin Packing is one of the research areas of Operations Research with many industrial applications, as well as rich theoretical impact. In this article, the authors deal with Bin Packing on the practical side: they consider two Bin Packing Benchmark c
Externí odkaz:
https://doaj.org/article/a40bd8ecd7aa4fe5820354b188f888f4
Publikováno v:
International Journal of Foundations of Computer Science. :1-16
Given a set of items, and a conflict graph defined on the item set, the problem of bin packing with conflicts asks for a partition of items into a minimum number of independent sets so that the total size of items in each independent set does not exc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af09fe9e3ea8ac8a0390ffdf58a7f92b
https://doi.org/10.1142/s0129054122460054
https://doi.org/10.1142/s0129054122460054
Publikováno v:
Optimization Letters. 16:2775-2785
More than half a century ago Martin Gardner popularized a question leading to the benchmark problem of determining the minimum side length of a square into which the squares of sizes $$1,2,\dots ,n$$ 1 , 2 , ⋯ , n can be packed without overlap. Con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe9279c0eb78473d3e23751228617249
https://doi.org/10.1007/s11590-022-01858-w
https://doi.org/10.1007/s11590-022-01858-w
Publikováno v:
European Journal of Operational Research. 297:844-852
The considered coupled task problem (CTP) is to schedule n jobs, each consisting of two (sub)tasks, on a single machine. Exact delay times are between the subtasks of a job and the makespan has to be minimized. It has been proven that the problem is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93220809fddee9d58555130d88d82487
https://doi.org/10.1016/j.ejor.2021.06.002
https://doi.org/10.1016/j.ejor.2021.06.002
Publikováno v:
Journal of Combinatorial Optimization. 43:613-629
We consider batched bin packing. Items are presented in a constant number of batches, and each batch should be packed before the next batch is presented. The cases of two, three, and four batches are studied. We prove improved lower bounds for the st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a8e4155adf0bf75b3e5b4e95d4ef4a4
https://doi.org/10.1007/s10878-021-00797-z
https://doi.org/10.1007/s10878-021-00797-z
Publikováno v:
Journal of Computer and System Sciences. 112:34-49
Cardinality constrained bin packing or bin packing with cardinality constraints is a basic bin packing problem. In the online version with the parameter k >= 2, items having sizes in (0,1] associated with them are presented one by one to be packed in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::020c7910b6cbf4c2a14294094b572c8b
https://doi.org/10.1016/j.jcss.2020.03.002
https://doi.org/10.1016/j.jcss.2020.03.002
Autor:
Peggy Näser, György Dósa, Tibor Dulai, Ronald Ortner, Peter Auer, Armin Fügenschuh, Ágnes Werner-Stark
Publikováno v:
Central European Journal of Operations Research. 29:1079-1113
We deal with a very complex and hard scheduling problem. Two types of products are processed by a heterogeneous resource set, where resources have different operating capabilities and setup times are considered. The processing of the products follows
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf4a45c7fb0c565e363e813a11440659
https://doi.org/10.1007/s10100-020-00689-3
https://doi.org/10.1007/s10100-020-00689-3
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031066771
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::262b709e89f24e22ab1fe2528ea63c52
https://doi.org/10.1007/978-3-031-06678-8_8
https://doi.org/10.1007/978-3-031-06678-8_8
Publikováno v:
Symmetry, Vol 13, Iss 1539, p 1539 (2021)
Symmetry
Volume 13
Issue 8
Symmetry
Volume 13
Issue 8
In this paper, we investigate partitions of highly symmetrical discrete structures called cycloids. In general, a mixed hypergraph has two types of hyperedges. The vertices are colored in such a way that each C-edge has two vertices of the same color
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a139d15dbfebaebcbc76d21770194bdd
https://www.mdpi.com/2073-8994/13/8/1539
https://www.mdpi.com/2073-8994/13/8/1539