Zobrazeno 1 - 10
of 185
pro vyhledávání: '"Silvano Martello"'
Publikováno v:
Discrete Applied Mathematics. 335:36-51
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c077ec466d70feb2cc6159b82295489
https://doi.org/10.1016/j.dam.2022.06.033
https://doi.org/10.1016/j.dam.2022.06.033
Publikováno v:
Discrete Applied Mathematics. 335:1-3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef2a736e273f6c2354b121876b455800
https://doi.org/10.1016/j.dam.2023.02.013
https://doi.org/10.1016/j.dam.2023.02.013
Publikováno v:
Annals of Operations Research. 314:5-13
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0f55c09595070ca8d4100589c156270
https://doi.org/10.1007/s10479-022-04730-3
https://doi.org/10.1007/s10479-022-04730-3
Publikováno v:
Optimization Letters. 16:471-480
Two-dimensional cutting and packing problems model a large number of relevant industrial applications.The literature on practical algorithms for such problems is very large. We introduce the , a library on two-dimensional orthogonal cutting and packi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb0be3bf0ecf7b98ce09c8dde9d1a529
https://doi.org/10.1007/s11590-021-01808-y
https://doi.org/10.1007/s11590-021-01808-y
Publikováno v:
Annals of Operations Research. 314:1-3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fcf55da96812d8b4178fff8e34a1fe5a
https://doi.org/10.1007/s10479-022-04731-2
https://doi.org/10.1007/s10479-022-04731-2
Autor:
Silvano Martello, John Baptist Gauci
Publikováno v:
Journal of Combinatorial Optimization
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c0ac49367a1571d901048a5224ac92e
https://doi.org/10.1007/s10878-021-00785-3
https://doi.org/10.1007/s10878-021-00785-3
We consider binary integer programming problems with the min-max regret objective function under interval objective coefficients. We propose a new heuristic framework, which we call the iterated dual substitution (iDS) algorithm. The iDS algorithm it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::272f2024bd3f75f169b8189178c7632d
https://hdl.handle.net/11380/1274246
https://hdl.handle.net/11380/1274246
Publikováno v:
Discrete Applied Mathematics. 290:68-70
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be0df7b3e395e63cec76bd5f417a5af2
https://doi.org/10.1016/j.dam.2020.12.014
https://doi.org/10.1016/j.dam.2020.12.014