Zobrazeno 1 - 10
of 330
pro vyhledávání: '"Fortz, Bernard"'
Autor:
Petropoulos, Fotios, Laporte, Gilbert, Aktas, Emel, Alumur, Sibel A., Archetti, Claudia, Ayhan, Hayriye, Battarra, Maria, Bennell, Julia A., Bourjolly, Jean-Marie, Boylan, John E., Breton, Michèle, Canca, David, Charlin, Laurent, Chen, Bo, Cicek, Cihan Tugrul, Cox Jr, Louis Anthony, Currie, Christine S. M., Demeulemeester, Erik, Ding, Li, Disney, Stephen M., Ehrgott, Matthias, Eppler, Martin J., Erdoğan, Güneş, Fortz, Bernard, Franco, L. Alberto, Frische, Jens, Greco, Salvatore, Gregory, Amanda J., Hämäläinen, Raimo P., Herroelen, Willy, Hewitt, Mike, Holmström, Jan, Hooker, John N., Işık, Tuğçe, Johnes, Jill, Kara, Bahar Y., Karsu, Özlem, Kent, Katherine, Köhler, Charlotte, Kunc, Martin, Kuo, Yong-Hong, Lienert, Judit, Letchford, Adam N., Leung, Janny, Li, Dong, Li, Haitao, Ljubić, Ivana, Lodi, Andrea, Lozano, Sebastián, Lurkin, Virginie, Martello, Silvano, McHale, Ian G., Midgley, Gerald, Morecroft, John D. W., Mutha, Akshay, Oğuz, Ceyda, Petrovic, Sanja, Pferschy, Ulrich, Psaraftis, Harilaos N., Rose, Sam, Saarinen, Lauri, Salhi, Said, Song, Jing-Sheng, Sotiros, Dimitrios, Stecke, Kathryn E., Strauss, Arne K., Tarhan, İstenç, Thielen, Clemens, Toth, Paolo, Berghe, Greet Vanden, Vasilakis, Christos, Vaze, Vikrant, Vigo, Daniele, Virtanen, Kai, Wang, Xun, Weron, Rafał, White, Leroy, Van Woensel, Tom, Yearworth, Mike, Yıldırım, E. Alper, Zaccour, Georges, Zhao, Xuying
Publikováno v:
Journal of the Operational Research Society (2024) 75(3)
Throughout its history, Operational Research has evolved to include a variety of methods, models and algorithms that have been applied to a diverse and wide range of contexts. This encyclopedic article consists of two main sections: methods and appli
Externí odkaz:
http://arxiv.org/abs/2303.14217
Publikováno v:
In Computers and Operations Research December 2023 160
Autor:
Almeftah, Tifaout, Brotcorne, Luce, Cattaruzza, Diego, Fortz, Bernard, Keita, Kaba, Labbé, Martine, Ogier, Maxime, Semet, Frédéric
Group testing is a screening strategy that involves dividing a population into several disjointed groups of subjects. In its simplest implementation, each group is tested with a single test in the first phase, while in the second phase only subjects
Externí odkaz:
http://arxiv.org/abs/2011.06927
We consider two covering variants of the network design problem. We are given a set of origin/destination pairs, called O/D pairs, and each such O/D pair is covered if there exists a path in the network from the origin to the destination whose length
Externí odkaz:
http://arxiv.org/abs/2007.06647
Publikováno v:
In Blockchain: Research and Applications September 2022 3(3)
Publikováno v:
In Computers and Operations Research January 2022 137
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:
Networks; Mar2024, Vol. 83 Issue 2, p256-288, 33p
Publikováno v:
In European Journal of Operational Research 1 November 2019 278(3):855-868