Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Enrico Angelelli"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 8, Iss 1 (2006)
In this paper we study a semi on-line version of the classical multiprocessor scheduling problem on two identical processors. We assume that the sum of the tasks and an upper bound gamma on the size of each task are known. Each task has to be assigne
Externí odkaz:
https://doaj.org/article/d7736e9b24404c9a98930f6de2497eb7
We consider an online version of the orienteering problem, where stochastic service requests arise during a first time interval from customers located on the nodes of a graph. Every request must be accepted/rejected in real time. Later, a vehicle mus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b46865094073afb8211976f1f29d411
http://hdl.handle.net/11379/547563
http://hdl.handle.net/11379/547563
Publikováno v:
Computers & Operations Research. 82:15-26
A novel time dependent version of the Traveling Purchaser Problem is presented.A LP model introducing constrains to represent dynamically changing quantities is defined.An exact method based on a branch-and-cut algorithm exploiting the structure of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1795ffd0ef55dc14bf655d36062f5dd
https://doi.org/10.1016/j.cor.2017.01.001
https://doi.org/10.1016/j.cor.2017.01.001
Publikováno v:
Computers & Operations Research. 81:269-281
A novel stochastic version of the orienteering problem is considered.The problem generalizes the probabilistic TSP.A deterministic equivalent MILP model is derived.A branch-and-cut procedure with special branching rules is developed.Matheuristic proc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6dc601f219706f1107b484bbbb91f1e6
https://doi.org/10.1016/j.cor.2016.12.025
https://doi.org/10.1016/j.cor.2016.12.025
This paper analyses the impact of parametric timing portfolio strategies on the U.S. stock market. In particular, we assume that the log-returns follow a given parametric Levy process and we describe a methodology to approximate the distributions of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e75e2d78e4059ea4c7d784c1299e93c
http://hdl.handle.net/10446/128427
http://hdl.handle.net/10446/128427
In system optimal traffic assignment of traffic flows with user constraints the total travel time is minimized on a set of paths with bounded length ensuring a certain level of fairness for users. Minimizing the total travel time may lead to experien
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25411c62026ffdacf9033c14dc57294b
http://hdl.handle.net/11379/516150
http://hdl.handle.net/11379/516150
Publikováno v:
Computers & Operations Research. 123:105002
Freight forwarding companies provide transportation services to shipping companies by organizing shipment of freights from origins to destinations. They typically handle long-haul intermodal transportation requiring synchronization among different tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22c25cda40d8855f9daa6a8233083c25
https://doi.org/10.1016/j.cor.2020.105002
https://doi.org/10.1016/j.cor.2020.105002
The benefits in reducing traffic congestion of system optimum with respect to user equilibrium traffic assignments are well-known. Recently a linear programming based approach was proposed that aims at achieving a compromise between the system perspe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ed63c2a0a93d3917b9c5e069165f5a6
http://hdl.handle.net/11379/508722
http://hdl.handle.net/11379/508722
Autor:
I. Arsik, Maria Grazia Speranza, Valentina Morandi, Enrico Angelelli, Martin W. P. Savelsbergh
We propose a proactive route guidance approach that integrates a system perspective: minimizing congestion, and a user perspective: minimizing travel inconvenience. The approach assigns paths to users so as to minimize congestion while not increasing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::705ac8ff8c8d919bc1c5ebbb71481d4c
http://hdl.handle.net/11379/488986
http://hdl.handle.net/11379/488986