Zobrazeno 1 - 10
of 5 161
pro vyhledávání: '"Yildirim, E. A."'
The Standard Quadratic optimization Problem (StQP), arguably the simplest among all classes of NP-hard optimization problems, consists of extremizing a quadratic form (the simplest nonlinear polynomial) over the standard simplex (the simplest polytop
Externí odkaz:
http://arxiv.org/abs/2406.01239
Standard quadratic optimization problems (StQPs) provide a versatile modelling tool in various applications. In this paper, we consider StQPs with a hard sparsity constraint, referred to as sparse StQPs. We focus on various tractable convex relaxatio
Externí odkaz:
http://arxiv.org/abs/2310.04340
Autor:
Qiu, Yuzhou, Yıldırım, E. Alper
We study linear programming relaxations of nonconvex quadratic programs given by the reformulation-linearization technique (RLT), referred to as RLT relaxations. We investigate the relations between the polyhedral properties of the feasible regions o
Externí odkaz:
http://arxiv.org/abs/2303.15073
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
Autor:
Qiu, Yuzhou, Yıldırım, E. Alper
Quadratic programs with box constraints involve minimizing a possibly nonconvex quadratic function subject to lower and upper bounds on each variable. This is a well-known NP-hard problem that frequently arises in various applications. We focus on tw
Externí odkaz:
http://arxiv.org/abs/2303.06761
Publikováno v:
Psychology Research and Behavior Management, Vol Volume 17, Pp 2681-2686 (2024)
Mustafa Can Koc,1,2 Elif Yildirim,3 Liliana Nanu,4 Gabriel Marian Manolache4 1School of Physical Education and Sports, Istanbul Gelisim University, Istanbul, Türkiye; 2Directorate of Sports Sciences Application and Research Center, Istanbul Gelisim
Externí odkaz:
https://doaj.org/article/aafc009521684ea5a8e5212f422f870c
Autor:
Yildirim, E. a, b, ⁎, Jimenez-Melero, E. a, d, Dacus, B. c, Dennett, C. c, Woller, K.B. c, Short, M. c, Mummery, P.M. b
Publikováno v:
In Fusion Engineering and Design November 2024 208
Autor:
Yildirim, E. a, b, ⁎, Mummery, P.M. b, Greaves, G. c, Race, C.P. e, Jimenez-Melero, E. a, d, ⁎
Publikováno v:
In Nuclear Materials and Energy June 2024 39
Publikováno v:
Cancer Management and Research, Vol Volume 15, Pp 1085-1096 (2023)
Eda Caliskan Yildirim,1 Yusuf Acikgoz,2 Yakup Ergun,2 Efnan Algin,2 Oznur Bal2 1Dokuz Eylul University, Department of Internal Medicine, Division of Medical Oncology, Izmir, Turkey; 2Health Sciences University Ankara City Hospital, Department of Medi
Externí odkaz:
https://doaj.org/article/ea53b707b7784eef84204a9009c2ad45
Autor:
Yildirim, E. Alper
Publikováno v:
Journal of Global Optimization, 82, 1-20, 2022
We study convex relaxations of nonconvex quadratic programs. We identify a family of so-called feasibility preserving convex relaxations, which includes the well-known copositive and doubly nonnegative relaxations, with the property that the convex r
Externí odkaz:
http://arxiv.org/abs/2006.00301