The robust shortest path problem with interval data OE Karaчsan, MC Pinar, H Yaman | 291* | 2003 |
The robust spanning tree problem with interval data H Yaman, OE Karaşan, MÇ Pınar Operations research letters 29 (1), 31-40, 2001 | 233 | 2001 |
On smoothing exact penalty functions for convex constrained optimization MÇ Pinar, SA Zenios SIAM Journal on Optimization 4 (3), 486-511, 1994 | 170 | 1994 |
On the S-procedure and some variants K Derinkuyu, MÇ Pınar Mathematical Methods of Operations Research 64, 55-77, 2006 | 134 | 2006 |
Provisioning virtual private networks under traffic uncertainty A Altın, E Amaldi, P Belotti, MÇ Pınar Networks: An International Journal 49 (1), 100-115, 2007 | 124 | 2007 |
An exact algorithm for the capacitated vertex p-center problem FA Özsoy, MÇ Pınar Computers & Operations Research 33 (5), 1420-1436, 2006 | 111 | 2006 |
The robust Merton problem of an ambiguity averse investor S Biagini, MÇ Pınar Mathematics and Financial Economics 11 (1), 1-24, 2017 | 83 | 2017 |
Robust scenario optimization based on downside-risk measure for multi-period portfolio selection MÇ Pınar OR Spectrum 29 (2), 295-309, 2007 | 81 | 2007 |
A smooth penalty function algorithm for network-structured problems SA Zenios, MC Pinar, RS Dembo European Journal of Operational Research 83 (1), 220-236, 1995 | 73 | 1995 |
Parallel decomposition of multicommodity network flows using a linear-quadratic penalty algorithm MC Pinar, SA Zenios ORSA Journal on Computing 4 (3), 235-249, 1992 | 66* | 1992 |
The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations A Altın, H Yaman, MÇ Pınar INFORMS Journal on Computing 23 (1), 75-89, 2011 | 65 | 2011 |
Robust profit opportunities in risky financial portfolios MÇ Pınar, RH Tütüncü Operations Research Letters 33 (4), 331-340, 2005 | 64 | 2005 |
Sufficient global optimality conditions for bivalent quadratic optimization MC Pinar Journal of optimization theory and applications 122, 433-440, 2004 | 48 | 2004 |
An efficient exact algorithm for the vertex p-center problem T Ilhan, MC Pinar Preprint.[Online]. Available: http://www. ie. bilkent. edu. tr/∼ mustafap/pubs, 2001 | 44 | 2001 |
OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty A Altın, P Belotti, MÇ Pınar Optimization and Engineering 11 (3), 395-422, 2010 | 41 | 2010 |
Restricted robust uniform matroid maximization under interval uncertainty H Yaman, OE Karaşan, MÇ Pınar Mathematical Programming 110 (2), 431-441, 2007 | 39* | 2007 |
A model and case study for efficient shelf usage and assortment analysis MM Fadılog̃lu, OE Karaşan, MÇ Pınar Annals of Operations Research 180, 105-124, 2010 | 38 | 2010 |
An efficient exact algorithm for the vertex p-center problem and computational experiments for different set covering subproblems T Ilhan, F Ozsoy, M Pinar Bilkent University, Department of Industrial Engineering, Technical Report, 2002 | 35* | 2002 |
Structured least squares problems and robust estimators M Pilanci, O Arikan, MC Pinar IEEE transactions on signal processing 58 (5), 2453-2465, 2010 | 33* | 2010 |
Robust screening under ambiguity MÇ Pınar, C Kızılkale Mathematical Programming 163, 273-299, 2017 | 32 | 2017 |