Mustafa Çelebi Pinar
Mustafa Çelebi Pinar
Professor of Industrial Eng. Bilkent University
Verified email at - Homepage
Cited by
Cited by
The robust shortest path problem with interval data
OE Karaşan, MÇ Pinar, H Yaman
Computers & Operations Research (to appear), 2001
The robust spanning tree problem with interval data
H Yaman, OE KaraşAn, MÇ PıNar
Operations research letters 29 (1), 31-40, 2001
On smoothing exact penalty functions for convex constrained optimization
MÇ Pinar, SA Zenios
SIAM Journal on Optimization 4 (3), 486-511, 1994
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
On the S-procedure and some variants
K Derinkuyu, MÇ Pınar
Mathematical Methods of Operations Research 64 (1), 55-77, 2006
An exact algorithm for the capacitated vertex p-center problem
FA Özsoy, MÇ Pınar
Computers & Operations Research 33 (5), 1420-1436, 2006
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
Robust scenario optimization based on downside-risk measure for multi-period portfolio selection
MÇ Pınar
OR Spectrum 29 (2), 295-309, 2007
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
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
Robust profit opportunities in risky financial portfolios
MÇ PıNar, RH Tütüncü
Operations Research Letters 33 (4), 331-340, 2005
The robust Merton problem of an ambiguity averse investor
S Biagini, MÇ Pınar
Mathematics and Financial Economics 11 (1), 1-24, 2017
Sufficient global optimality conditions for bivalent quadratic optimization
MC Pinar
Journal of optimization theory and applications 122 (2), 433-440, 2004
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
Restricted robust uniform matroid maximization under interval uncertainty
H Yaman, OE Karaşan, MÇ Pınar
Mathematical Programming 110 (2), 431-441, 2007
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
Decomposing linear programs for parallel solution
A Pinar, ÜV Çatalyürek, C Aykanat, M Pinar
International Workshop on Applied Parallel Computing, 473-482, 1995
A new finite continuation algorithm for linear programming
K Madsen, HB Nielsen, MÇ Pinar
SIAM Journal on Optimization 6 (3), 600-616, 1996
An efficient exact algorithm for the vertex p-center problem and computational experiments for different set covering subproblems
T Ilhan, FA Ozsoy, MC Pinar
Bilkent University, Department of Industrial Engineering, Technical Report, 2002
Structured least squares problems and robust estimators
M Pilanci, O Arikan, MC Pinar
IEEE transactions on signal processing 58 (5), 2453-2465, 2010
The system can't perform the operation now. Try again later.
Articles 1–20