Zobrazeno 1 - 10
of 70
pro vyhledávání: '"Federico Della Croce"'
Publikováno v:
4OR. 20:533-566
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b897cd83e5fcb07c55b3664ae76117a
https://doi.org/10.1007/s10288-022-00525-1
https://doi.org/10.1007/s10288-022-00525-1
Publikováno v:
Mathematical Programming. 183:249-281
We consider the bilevel knapsack problem with interdiction constraints, an extension of the classic 0–1 knapsack problem formulated as a Stackelberg game with two agents, a leader and a follower, that choose items from a common set and hold their o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d4ec864401fbb690a9cb018710d9c9e
https://doi.org/10.1007/s10107-020-01482-5
https://doi.org/10.1007/s10107-020-01482-5
Publikováno v:
Computers and Operations Research
Computers and Operations Research, Elsevier, 2022, 138, pp.105595. ⟨10.1016/j.cor.2021.105595⟩
Computers and Operations Research, Elsevier, 2022, 138, pp.105595. ⟨10.1016/j.cor.2021.105595⟩
We consider the NP-hard two-machine flow shop problem with three operations with the objective of minimizing the makespan. We exploit the links between this problem and another two-machine flow shop problem with common due date and jobs selection. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b553a25f4874823ce63ddd7f957b7790
https://hal.archives-ouvertes.fr/hal-03455224
https://hal.archives-ouvertes.fr/hal-03455224
Publikováno v:
Annals of Operations Research. 316:1107-1119
Single-elimination (knockout) tournaments are the standard paradigm for both main tennis professional associations, WTA and ATP. Schedules are generated by allocating first seeded and then unseeded players with seeds prevented from encountering each
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf6d2ee5b0fae558f1b568f6be4c0449
https://doi.org/10.1007/s10479-020-03517-8
https://doi.org/10.1007/s10479-020-03517-8
Publikováno v:
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization, Springer Verlag, 2020, 39 (3), pp.764-775. ⟨10.1007/s10878-019-00512-z⟩
Journal of Combinatorial Optimization, Springer Verlag, 2020, 39 (3), pp.764-775. ⟨10.1007/s10878-019-00512-z⟩
This paper focuses on the solution, by exact exponential-time algorithms, of just-in-time scheduling problems when jobs have symmetric earliness/tardiness weights and share a non restrictive common due date. For the single machine problem, a Sort & S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa222555d876510756ccc9b40be9cc96
https://doi.org/10.1007/s10878-019-00512-z
https://doi.org/10.1007/s10878-019-00512-z
Publikováno v:
Journal of Combinatorial Optimization. 38:608-617
We consider problem $$P2 || C_{\max }$$ where the goal is to schedule n jobs on two identical parallel machines to minimize the makespan. We focus on constant factor approximation algorithms with complexity independent from the required accuracy. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24ba965ff9b6e0e8b28b3116f4c92b76
https://doi.org/10.1007/s10878-019-00399-w
https://doi.org/10.1007/s10878-019-00399-w
Publikováno v:
Computers and Operations Research
Computers and Operations Research, Elsevier, 2021, 128, ⟨10.1016/j.cor.2020.105171⟩
Computers and Operations Research, Elsevier, 2021, 128, ⟨10.1016/j.cor.2020.105171⟩
Memorization, as an algorithm design technique, enables to speed up algorithms at the price of increased space usage. In this work, we focus on search tree algorithms applied to sequencing problems. In these algorithms, on lower branching levels, iso
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::edca914f0a6cadb3ac916b559f8f74f0
https://hal.archives-ouvertes.fr/hal-03064422
https://hal.archives-ouvertes.fr/hal-03064422
Publikováno v:
Journal of Scheduling. 23:163-176
We consider the $$P_m || C_{\max }$$ scheduling problem where the goal is to schedule n jobs on m identical parallel machines $$(m < n)$$ to minimize makespan. We revisit the famous Longest Processing Time (LPT) rule proposed by Graham in 1969. LPT r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b0a07732bdd4d308516a683804e76c39
https://doi.org/10.1007/s10951-018-0597-6
https://doi.org/10.1007/s10951-018-0597-6
Publikováno v:
Journal of Discrete Algorithms. :55-69
The 0–1 Incremental Knapsack Problem (IKP) is a generalization of the standard 0–1 Knapsack Problem (KP) where the capacity grows over time periods and if an item is placed in the knapsack in a certain period, it cannot be removed afterwards. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::881ced84ff8c9c3dcb63611606d23a9f
https://doi.org/10.1016/j.jda.2018.11.005
https://doi.org/10.1016/j.jda.2018.11.005
Autor:
Monica Gentili, Federico Della Croce, Francesco Carrabs, Raffaele Cerulli, Ciriaco D’Ambrosio
Publikováno v:
Omega. 104:102492
We study the problem of determining the bounds of the optimal cost of a transportation problem when the capacity of the suppliers and the demand of the customers vary over an interval. We consider transportation costs such that the transportation par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72e915096356c9008befc14dbb8806e9
https://doi.org/10.1016/j.omega.2021.102492
https://doi.org/10.1016/j.omega.2021.102492