Zobrazeno 1 - 10
of 367
pro vyhledávání: '"Zieliński, Paweł"'
Autor:
Kasperski, Adam, Zielinski, Pawel
In this paper, the recoverable robust shortest path problem in acyclic digraphs is considered. The interval budgeted uncertainty representation is used to model the uncertain second-stage costs. The computational complexity of this problem has been o
Externí odkaz:
http://arxiv.org/abs/2410.09425
Autor:
Han, Cheongho, Bond, Ian A., Lee, Chung-Uk, Gould, Andrew, Albrow, Michael D., Chung, Sun-Ju, Hwang, Kyu-Ha, Jung, Youn Kil, Ryu, Yoon-Hyun, Shvartzvald, Yossi, Shin, In-Gu, Yee, Jennifer C., Yang, Hongjing, Zang, Weicheng, Cha, Sang-Mok, Kim, Doeon, Kim, Dong-Jin, Kim, Seung-Lee, Lee, Dong-Joo, Lee, Yongseok, Park, Byeong-Gon, Pogge, Richard W., Abe, Fumio, Bando, Ken, Barry, Richard, Bennett, David P., Bhattacharya, Aparna, Fujii, Hirosame, Fukui, Akihiko, Hamada, Ryusei, Hamasaki, Shunya Hamada Naoto, Hirao, Yuki, Silva, Stela Ishitani, Itow, Yoshitaka, Kirikawa, Rintaro, Koshimoto, Naoki, Matsubara, Yutaka, Miyazaki, Shota, Muraki, Yasushi, Nagai, Tutumi, Nunota, Kansuke, Olmschenk, Greg, Ranc, Clément, Rattenbury, Nicholas J., Satoh, Yuki, Sumi, Takahiro, Suzuki, Daisuke, Tomoyoshi, Mio, Tristram, Paul J., Vandorou, Aikaterini, Yama, Hibiki, Yamashita, Kansuke, Bachelet, Etienne, Rota, Paolo, Bozza, Valerio, Zielinski, Paweł, Street, Rachel A., Tsapras, Yiannis, Hundertmark, Markus, Wambsganss, Joachim, Wyrzykowski, Łukasz, Jaimes, Roberto Figuera, Cassan, Arnaud, Dominik, Martin, Rybicki, Krzysztof A., Rabus, Markus
We investigated the nature of the anomalies appearing in four microlensing events KMT-2020-BLG-0757, KMT-2022-BLG-0732, KMT-2022-BLG-1787, and KMT-2022-BLG-1852. The light curves of these events commonly exhibit initial bumps followed by subsequent t
Externí odkaz:
http://arxiv.org/abs/2406.10547
In this paper the recoverable robust shortest path problem is investigated. Discrete budgeted interval uncertainty representation is used to model uncertain second-stage arc costs. The known complexity results for this problem are strengthened. It is
Externí odkaz:
http://arxiv.org/abs/2403.20000
Autor:
Fiorellino, Eleonora, Abraham, Peter, Kospal, Agnes, Kun, Maria, Alcala, Juan M., Garatti, Alessio Caratti o, de Miera, Fernando Cruz-Saenz, Garcia-Alvarez, David, Giannini, Teresa, Park, Sunkyung, Siwak, Michal, Szilagyi, Mate, Covino, Elvira, Marton, Gabor, Nagy, Zsofia, Nisini, Brunella, Szabo, Zsofia Marianna, Bora, Zsofia, Cseh, Borbala, Kalup, Csilla, Krezinger, Mate, Kriskovics, Levente, Ogloza, Waldemar, Pal, Andras, Sodor, Adam, Sonbas, Eda, Szakats, Robert, Vida, Krisztian, Vinko, Jozsef, Wyrzykowski, Lukasz, Zielinski, Pawel
Publikováno v:
A&A 686, A160 (2024)
Context. Gaia18cjb is one of the Gaia-alerted eruptive young star candidates which has been experiencing a slow and strong brightening during the last 13 years, similar to some FU Orionis-type objects. Aims. The aim of this work is to derive the youn
Externí odkaz:
http://arxiv.org/abs/2403.08698
In this paper, the recoverable robust shortest path problem under interval uncertainty representations is discussed. This problem is known to be strongly NP-hard and also hard to approximate in general digraphs. In this paper, the class of acyclic di
Externí odkaz:
http://arxiv.org/abs/2401.05715
This paper discusses a class of combinatorial optimization problems with uncertain costs in the objective function. It is assumed that a sample of the cost realizations is available, which defines an empirical probability distribution for the random
Externí odkaz:
http://arxiv.org/abs/2312.12769
This paper deals with the recoverable robust shortest path problem under the interval uncertainty representation. The problem is known to be strongly NP-hard and not approximable in general digraphs. Polynomial time algorithms for the problem under c
Externí odkaz:
http://arxiv.org/abs/2309.02816
In decision-making under uncertainty, several criteria have been studied to aggregate the performance of a solution over multiple possible scenarios. This paper introduces a novel variant of ordered weighted averaging (OWA) for optimization problems.
Externí odkaz:
http://arxiv.org/abs/2308.08522
Autor:
Nagy, Zsófia, Park, Sunkyung, Ábrahám, Péter, Kóspál, Ágnes, de Miera, Fernando Cruz-Sáenz, Kun, Mária, Siwak, Michał, Szabó, Zsófia Marianna, Szilágyi, Máté, Fiorellino, Eleonora, Giannini, Teresa, Lee, Jae-Joon, Lee, Jeong-Eun, Marton, Gábor, Szabados, László, Vitali, Fabrizio, Andrzejewski, Jan, Gromadzki, Mariusz, Hodgkin, Simon, Jabłońska, Maja, Mendez, Rene A., Merc, Jaroslav, Michniewicz, Olga, Mikołajczyk, Przemysław J., Pylypenko, Uliana, Ratajczak, Milena, Wyrzykowski, Łukasz, Zejmo, Michal, Zieliński, Paweł
FU Orionis objects (FUors) are eruptive young stars, which exhibit outbursts that last from decades to a century. Due to the duration of their outbursts, and to the fact that only about two dozens of such sources are known, information on the end of
Externí odkaz:
http://arxiv.org/abs/2307.01629
In this paper, an optimization problem with uncertain objective function coefficients is considered. The uncertainty is specified by providing a discrete scenario set, containing possible realizations of the objective function coefficients. The conce
Externí odkaz:
http://arxiv.org/abs/2303.05067