Mustafa Ç. Pinar

Mustafa Pinar

	2013
j31		Mustafa Ç. Pinar: Mixed-integer second-order cone programming for lower hedging of American contingent claims in incomplete markets. Optimization Letters 7(1): 63-78 (2013)
	2011
j30		Aysegül Altin, Hande Yaman, Mustafa Ç. Pinar: The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations. INFORMS Journal on Computing 23(1): 75-89 (2011)
	2010
j29		Mehmet Murat Fadiloglu, Oya Ekin Karasan, Mustafa Ç. Pinar: A model and case study for efficient shelf usage and assortment analysis. Annals OR 180(1): 105-124 (2010)
j28		Mustafa Ç. Pinar, Aslihan Salih, Ahmet Camci: Expected gain-loss pricing and hedging of contingent claims in incomplete markets by linear programming. European Journal of Operational Research 201(3): 770-785 (2010)
j27		Mert Pilanci, Orhan Arikan, Mustafa Ç. Pinar: Structured least squares problems and robust estimators. IEEE Transactions on Signal Processing 58(5): 2453-2465 (2010)
	2009
j26		Robert J. Vanderbei, Mustafa Ç. Pinar: Pricing American Perpetual Warrants by Linear Programming. SIAM Review 51(4): 767-782 (2009)
c4		Mert Pilanci, Orhan Arikan, B. Oguz, Mustafa Ç. Pinar: Structured least squares with bounded data uncertainties. ICASSP 2009: 3261-3264
r1		Mustafa Ç. Pinar: Overdetermined Systems of Linear Equations. Encyclopedia of Optimization 2009: 2893-2896
	2008
j25		Mustafa Ç. Pinar: Sharpe-ratio pricing and hedging of contingent claims in incomplete markets by convex programming. Automatica 44(8): 2063-2073 (2008)
	2007
j24		Bora Uçar, Cevdet Aykanat, Mustafa Ç. Pinar, Tahir Malas: Parallel image restoration using surrogate constraint methods. J. Parallel Distrib. Comput. 67(2): 186-204 (2007)
j23		Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar: Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty. Math. Program. 110(2): 431-441 (2007)
j22		Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar: Provisioning virtual private networks under traffic uncertainty. Networks 49(1): 100-115 (2007)
j21		Kürsad Derinkuyu, Mustafa Ç. Pinar, Ahmet Camci: An improved probability bound for the Approximate S-Lemma. Oper. Res. Lett. 35(6): 743-746 (2007)
	2006
j20		F. Aykut Özsoy, Mustafa Ç. Pinar: An exact algorithm for the capacitated vertex p-center problem. Computers & OR 33: 1420-1436 (2006)
j19		Bülent Karasözen, Mustafa Ç. Pinar, Tamás Terlaky, Gerhard-Wilhelm Weber: Feature Cluster "Advances in Continuous Optimization". European Journal of Operational Research 169(3): 1077-1078 (2006)
j18		Mustafa Ç. Pinar, Wolfgang M. Hartmann: Huber approximation for the non-linear l. European Journal of Operational Research 169(3): 1096-1107 (2006)
j17		Kürsad Derinkuyu, Mustafa Ç. Pinar: On the S-procedure and Some Variants. Math. Meth. of OR 64(1): 55-77 (2006)
j16		Mustafa Ç. Pinar, Marc Teboulle: On semidefinite bounds for maximization of a non-convex quadratic objective over the l1 unit ball. RAIRO - Operations Research 40(3): 253-265 (2006)
	2005
j15		Mustafa Ç. Pinar, Reha H. Tütüncü: Robust profit opportunities in risky financial portfolios. Oper. Res. Lett. 33(4): 331-340 (2005)
	2004
j14		Mustafa Ç. Pinar: A note on robust 0-1 optimization with uncertain cost coefficients. 4OR 2(4): 309-316 (2004)
j13		Mustafa Ç. Pinar: Finite Computation of the l1 Estimator from Huber's M-Estimator in Linear Regression. Computing 72(3-4): 365-384 (2004)
j12		Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar: Virtual Private Network Design Under Traffic Uncertainty. Electronic Notes in Discrete Mathematics 17: 19-22 (2004)
c3		Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar: Virtual Private Network Design Under Traffic Uncertainty. CTW 2004: 24-27
	2003
j11		Mustafa Ç. Pinar: A Derivation of Lovász' Theta via Augmented Lagrange Duality. RAIRO - Operations Research 37(1): 17-27 (2003)
	2002
j10		Mustafa Ç. Pinar: A global error bound for quadratic perturbation of linear programs. Appl. Math. Lett. 15(3): 367-370 (2002)
	2001
j9		Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar: The robust spanning tree problem with interval data. Oper. Res. Lett. 29(1): 31-40 (2001)
	2000
j8		Mustafa Ç. Pinar: A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications. European Journal of Operational Research 124(1): 151-158 (2000)
j7		Ülkü Gürler, Mustafa Ç. Pinar, Mohamed Mehdi Jelassi: On closed-form solutions of a resource allocation problem in parallel funding of R&D projects. Oper. Res. Lett. 27(5): 229-234 (2000)
	1999
j6		Bintong Chen, Patrick T. Harker, Mustafa Ç. Pinar: Continuation method for nonlinear complementarity problems via normal maps. European Journal of Operational Research 116(3): 591-606 (1999)
	1996
j5		Mustafa Ç. Pinar: Linear programming via a quadratic penalty function. Math. Meth. of OR 44(3): 345-370 (1996)
c2		Hakan Özaktas, Mustafa Akgül, Mustafa Pinar: The Parallel Surrogate Constraint Approach to the Linear Feasibility Problem. PARA 1996: 565-574
	1995
j4		Claus Bendtsen, Per Christian Hansen, Kaj Madsen, Hans Bruun Nielsen, Mustafa Pinar: Implementation of QR Up- and Downdating on a Massively Parallel Computer. Parallel Computing 21(1): 49-61 (1995)
c1		Ali Pinar, Ümit V. Çatalyürek, Cevdet Aykanat, Mustafa Pinar: Decomposing Linear Programs for Parallel Solution. PARA 1995: 473-482
	1994
j3		Mustafa Pinar, Stavros A. Zenios: A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows. ACM Trans. Math. Softw. 20(4): 531-552 (1994)
	1993
j2		Mustafa Ç. Pinar, Stavros A. Zenios: A Comparative Study of Parallel Decompositions for Multicommodity Flow Problems. Parallel Algorithms Appl. 1(4): 255-271 (1993)
	1992
j1		Mustafa Ç. Pinar, Stavros A. Zenios: Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm. INFORMS Journal on Computing 4(3): 235-249 (1992)

Coauthor Index

Colors in the list of coauthors

Last update Thu May 23 07:02:24 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page