Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Natashia Boland"'
Publikováno v:
Networks. 80:572-596
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9982e5799a8c524f56061523528a97f3
https://doi.org/10.1002/net.22128
https://doi.org/10.1002/net.22128
Publikováno v:
Manufacturing & Service Operations Management. 24:3252-3268
Problem definition: Although physical (or “social”) distancing is an important public health intervention during airborne pandemics, physical distancing dramatically reduces the effective capacity of classrooms. Academic/practical relevance: Duri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0604d546e2f7c858a4c9ab0ed9db7bcd
https://doi.org/10.1287/msom.2022.1131
https://doi.org/10.1287/msom.2022.1131
Publikováno v:
European Journal of Operational Research. 301:1021-1034
We design and implement decision support technology to assist dispatchers in the daily management of loadplans in less-than-truckload service networks. The freight volume that enters a service network on the day of operations deviates from the foreca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b12944eff09ed68cda2231af80fcffec
https://doi.org/10.1016/j.ejor.2021.11.044
https://doi.org/10.1016/j.ejor.2021.11.044
Publikováno v:
European Journal of Operational Research. 301:828-840
Branching on a set of variables, rather than on a single variable, can give tighter bounds at the child nodes and can result in smaller search trees. However, selecting a good set of variables to branch on is even more challenging than selecting a go
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::436be72020c65ce6e465966af3c66b84
https://doi.org/10.1016/j.ejor.2021.11.050
https://doi.org/10.1016/j.ejor.2021.11.050
Publikováno v:
European Journal of Operational Research. 300:966-978
Package express companies routinely operate multiple equipment types in their service networks. Nevertheless, the weekly schedule of movements used to transport packages through the network leads to changes in equipment inventory at the facility leve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4956ea79b64a12180cf6302b95a95810
https://doi.org/10.1016/j.ejor.2021.09.005
https://doi.org/10.1016/j.ejor.2021.09.005
Publikováno v:
INFORMS Journal on Computing. 34:1086-1114
Finding a shortest path in a network is a fundamental optimization problem. We focus on settings in which the travel time on an arc in the network depends on the time at which traversal of the arc begins. In such settings, reaching the destination as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37a72285dcd2c0dc2ff85d6aedf6a590
https://doi.org/10.1287/ijoc.2021.1084
https://doi.org/10.1287/ijoc.2021.1084
Publikováno v:
Mathematical Programming. 196:427-477
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::265dda566183e7e923f52e6177f93cb9
https://doi.org/10.1007/s10107-021-01765-5
https://doi.org/10.1007/s10107-021-01765-5
Publikováno v:
Transportation Science.
Less-than-truckload (LTL) carriers transport freight shipments from origins to destinations by consolidating freight using a network of terminals. As daily freight quantities are uncertain, carriers dynamically decide freight routes on the day of ope
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53bd5d6cecf156cef337b9c59ae30ba4
https://doi.org/10.1287/trsc.2022.1190
https://doi.org/10.1287/trsc.2022.1190
Publikováno v:
INFORMS Journal on Computing. 33:997-1014
Waiting at the right location at the right time can be critically important in certain variants of time-dependent shortest path problems. We investigate the computational complexity of time-dependent shortest path problems in which there is either a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e899ca011f581d08060d87d3e559e8f5
https://doi.org/10.1287/ijoc.2020.0985
https://doi.org/10.1287/ijoc.2020.0985
Publikováno v:
Transportation Science. 55:29-51
We introduce an effective and efficient iterative algorithm for solving the continuous-time service network design problem. The algorithm achieves its efficiency by carefully and dynamically refining partially time-expanded network models so that onl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cac677a57f8fe57085f59076c7950778
https://doi.org/10.1287/trsc.2020.0994
https://doi.org/10.1287/trsc.2020.0994