Zobrazeno 1 - 10
of 228
pro vyhledávání: '"Circulation 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.
Publikováno v:
IEEE Transactions on Automatic Control. 66:5637-5650
In this paper, we consider a flow network that is described by a digraph, each edge of which can admit a flow within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. We propose and analyze a distributed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f664c5652e1062876e3875ec994459e4
https://doi.org/10.1109/tac.2020.3036288
https://doi.org/10.1109/tac.2020.3036288
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :462-473
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f048171ba509b6c579804f950a24394f
https://doi.org/10.1587/transfun.2020map0010
https://doi.org/10.1587/transfun.2020map0010
Publikováno v:
Journal of Combinatorial Optimization. 44:2040-2055
In this paper, we study the general restricted inverse assignment problems, in which we can only change the costs of some specific edges of an assignment problem as less as possible, so that a given assignment becomes the optimal one. Under $$l_1$$ n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89df1fc33fb4de797e4d0b767dc57d15
https://doi.org/10.1007/s10878-020-00577-1
https://doi.org/10.1007/s10878-020-00577-1
Publikováno v:
Discrete optimization 31 (2019): 93–102. doi:10.1016/j.disopt.2018.09.002
info:cnr-pdr/source/autori:Di Francesco M.; Gentile C.; Schirra S.; Stecca G.; Zuddas P./titolo:An integral LP relaxation for a drayage problem/doi:10.1016%2Fj.disopt.2018.09.002/rivista:Discrete optimization/anno:2019/pagina_da:93/pagina_a:102/intervallo_pagine:93–102/volume:31
info:cnr-pdr/source/autori:Di Francesco M.; Gentile C.; Schirra S.; Stecca G.; Zuddas P./titolo:An integral LP relaxation for a drayage problem/doi:10.1016%2Fj.disopt.2018.09.002/rivista:Discrete optimization/anno:2019/pagina_da:93/pagina_a:102/intervallo_pagine:93–102/volume:31
This paper investigates a drayage problem, where a fleet of trucks must ship container loads from a port to importers and from exporters to the same port, without separating trucks and containers during customer service. We present three formulations
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::072d8d23341af837ae79ebd96cb1f2b1
https://doi.org/10.1016/j.disopt.2018.09.002
https://doi.org/10.1016/j.disopt.2018.09.002
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.
Conference
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:
European Journal of Operational Research. 259:864-872
We present a specialized network simplex algorithm for the budget-constrained minimum cost flow problem , which is an extension of the traditional minimum cost flow problem by a second kind of costs associated with each edge, whose total value in a f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34c62b26a1dd9597aa4fee445db03431
https://doi.org/10.1016/j.ejor.2016.11.024
https://doi.org/10.1016/j.ejor.2016.11.024
Publikováno v:
Annals of Operations Research. 272:29-39
Flow variations over time generalize standard network flows by introducing an element of time. In contrast to the classical case of static flows, a flow over time in such a network specifies a flow rate entering an arc for each point in time. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81131d922b802f666d6353acffb1aade
https://doi.org/10.1007/s10479-017-2450-2
https://doi.org/10.1007/s10479-017-2450-2
Autor:
Vahid Hashemi
Publikováno v:
Optimization Letters. 11:1477-1487
In this paper, we study discrete infinite-time horizon undiscounted finite-state and finite-action \(\textit{MDP}\)s with average cost criteria. Based on a combinatorial approach, we show that completely ergodic \(\textit{MDP}\)s can be reduced to a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::117a1b92b45654579aac320deeec0255
https://doi.org/10.1007/s11590-017-1111-3
https://doi.org/10.1007/s11590-017-1111-3