default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMustafa Ç. Pinar
Person information
- affiliation: Bilkent University, Department of Industrial Engineering, Ankara, Turkey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j69]Çagin Ararat
, Francesco Cesarone, Mustafa Çelebi Pinar, Jacopo M. Ricci:
MAD risk parity portfolios. Ann. Oper. Res. 336(1-2): 899-924 (2024)- [j68]Ecenur Oguz, Yalim Dogan, Ugur Güdükbay, Oya Ekin Karasan, Mustafa Ç. Pinar:
Point cloud registration with quantile assignment. Mach. Vis. Appl. 35(3): 38 (2024) - [i1]Fatih S. Aktas, Mustafa Ç. Pinar:
Separable Bregman Framework for Sparsity Constrained Nonlinear Optimization. CoRR abs/2409.12343 (2024) - 2023
- [j67]Ömer Ekmekcioglu, Mustafa Ç. Pinar:
Graph neural networks for deep portfolio optimization. Neural Comput. Appl. 35(28): 20663-20674 (2023) - [j66]Fatih S. Aktas, Mustafa Ç. Pinar:
PCA Sparsified. SIAM J. Optim. 33(3): 2089-2117 (2023) - 2022
- [j65]Ömer Ekmekcioglu, Deniz Akkaya, Mustafa Ç. Pinar:
Subset based error recovery. Signal Process. 191: 108361 (2022) - [c7]Claudio Arbib, Fabrizio Marinelli, Mustafa Ç. Pinar, Andrea Pizzuti:
Assortment and Cut of Defective Stocks by Bilevel Programming. ICORES 2022: 294-301 - 2021
- [c6]Stéphane Chrétien, Oya Ekin Karasan, Ecenur Oguz, Mustafa Ç. Pinar:
The Quantile Matching Problem and Point Cloud Registration. ACDA 2021: 13-20 - 2020
- [j64]Alper Sen, Kamyar Kargar, Esma Akgün, Mustafa Ç. Pinar:
Codon optimization: a mathematical programing approach. Bioinform. 36(13): 4012-4020 (2020) - [j63]Claudio Arbib, Mustafa Ç. Pinar, Fabrizio Rossi, Alessandra Tessitore:
Codon optimization by 0-1 linear programming. Comput. Oper. Res. 119: 104932 (2020) - [j62]Claudio Arbib, Mustafa Ç. Pinar, Matteo Tonelli:
Competitive location and pricing on a line with metric transportation costs. Eur. J. Oper. Res. 282(1): 188-200 (2020) - [j61]Deniz Akkaya, Mustafa Ç. Pinar:
Minimizers of Sparsity Regularized Huber Loss Function. J. Optim. Theory Appl. 187(1): 205-233 (2020)
2010 – 2019
- 2019
- [j60]Claudio Arbib, Oya Ekin Karasan, Mustafa Ç. Pinar:
On envy-free perfect matching. Discret. Appl. Math. 261: 22-27 (2019) - [j59]Halil I. Bayrak, Kamyar Kargar, Mustafa Ç. Pinar:
Bilateral trade with risk-averse intermediary using linear network optimization. Networks 74(4): 325-332 (2019) - [j58]Mustafa Ç. Pinar:
Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines. SIAM J. Matrix Anal. Appl. 40(1): 194-209 (2019) - [c5]Tolga Dizdarer, Mustafa Ç. Pinar:
Deblurring Text Images Using Kernel Dictionaries. IPTA 2019: 1-6 - 2018
- [j57]Çagil Koçyigit, Halil I. Bayrak, Mustafa Ç. Pinar:
Robust auction design under multiple priors by linear and integer programming. Ann. Oper. Res. 260(1-2): 233-253 (2018) - [j56]A. Burak Paç, Mustafa Ç. Pinar:
On robust portfolio and naïve diversification: mixing ambiguous and unambiguous assets. Ann. Oper. Res. 266(1-2): 223-253 (2018) - [j55]Kamyar Kargar, Halil Ibrahim Bayrak, Mustafa Ç. Pinar:
Robust bilateral trade with discrete types. EURO J. Comput. Optim. 6(4): 367-393 (2018) - [j54]Mustafa Ç. Pinar:
Robust trading mechanisms over 0/1 polytopes. J. Comb. Optim. 36(3): 845-860 (2018) - [j53]Mustafa Ç. Pinar:
On explicit solutions of a two-echelon supply chain coordination game. Optim. Lett. 12(3): 661-673 (2018) - 2017
- [j52]Mustafa Ç. Pinar, Can Kizilkale:
Robust screening under ambiguity. Math. Program. 163(1-2): 273-299 (2017) - [j51]Halil I. Bayrak, Kemal Güler, Mustafa Ç. Pinar:
Optimal allocation with costly inspection and discrete types under ambiguity. Optim. Methods Softw. 32(4): 699-718 (2017) - 2016
- [j50]Fabio Bellini, Oya Ekin Karasan, Mustafa Ç. Pinar:
Joint mixability of some integer matrices. Discret. Optim. 20: 90-104 (2016) - [j49]Regina Sandra Burachik, C. Yalçin Kaya, Mustafa Ç. Pinar:
Special issue on "Non-linear continuous optimization". EURO J. Comput. Optim. 4(1): 1-2 (2016) - 2015
- [j48]Mustafa Ç. Pinar:
Non-linear pricing by convex duality. Autom. 53: 369-375 (2015) - 2014
- [j47]Mustafa Ç. Pinar:
Lower hedging of American contingent claims with minimal surplus risk in finite-state financial markets by mixed-integer linear programming. Discret. Appl. Math. 164: 304-312 (2014) - [j46]Mustafa Ç. Pinar:
Equilibrium in an ambiguity-averse mean-variance investors market. Eur. J. Oper. Res. 237(3): 957-965 (2014) - [j45]Mustafa Ç. Pinar:
Sur l'allocation dynamique de portefeuille robuste contre l'incertitude des rendements moyens. INFOR Inf. Syst. Oper. Res. 52(1): 14-19 (2014) - [j44]Mustafa Ç. Pinar, A. Burak Paç:
Mean semi-deviation from a target and robust portfolio choice under distribution and mean return ambiguity. J. Comput. Appl. Math. 259: 394-405 (2014) - [j43]Annalisa Fabretti, Stefano Herzel, Mustafa Ç. Pinar:
Delegated portfolio management under ambiguity aversion. Oper. Res. Lett. 42(2): 190-195 (2014) - 2013
- [j42]Mustafa Ç. Pinar:
Mixed-integer second-order cone programming for lower hedging of American contingent claims in incomplete markets. Optim. Lett. 7(1): 63-78 (2013) - [j41]Sara Biagini, Mustafa Ç. Pinar:
The Best Gain-Loss Ratio is a Poor Performance Measure. SIAM J. Financial Math. 4(1): 228-242 (2013) - 2011
- [j40]Mustafa Ç. Pinar:
Gain-loss based convex risk limits in discrete-time trading. Comput. Manag. Sci. 8(3): 299-321 (2011) - [j39]Aysegül Altin, Hande Yaman, Mustafa Ç. Pinar:
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations. INFORMS J. Comput. 23(1): 75-89 (2011) - 2010
- [j38]Mehmet Murat Fadiloglu, Oya Ekin Karasan, Mustafa Ç. Pinar:
A model and case study for efficient shelf usage and assortment analysis. Ann. Oper. Res. 180(1): 105-124 (2010) - [j37]Mustafa Ç. Pinar, Aslihan Altay-Salih, Ahmet Camci:
Expected gain-loss pricing and hedging of contingent claims in incomplete markets by linear programming. Eur. J. Oper. Res. 201(3): 770-785 (2010) - [j36]Mert Pilanci, Orhan Arikan, Mustafa Ç. Pinar:
Structured least squares problems and robust estimators. IEEE Trans. Signal Process. 58(5): 2453-2465 (2010)
2000 – 2009
- 2009
- [j35]Robert J. Vanderbei, Mustafa Ç. Pinar:
Pricing American Perpetual Warrants by Linear Programming. SIAM Rev. 51(4): 767-782 (2009) - [c4]Mert Pilanci, Orhan Arikan, Barlas 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
- [j34]Mustafa Ç. Pinar:
Sharpe-ratio pricing and hedging of contingent claims in incomplete markets by convex programming. Autom. 44(8): 2063-2073 (2008) - 2007
- [j33]Bora Uçar, Cevdet Aykanat, Mustafa Ç. Pinar, Tahir Malas:
Parallel image restoration using surrogate constraint methods. J. Parallel Distributed Comput. 67(2): 186-204 (2007) - [j32]Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar:
Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty. Math. Program. 110(2): 431-441 (2007) - [j31]Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar:
Provisioning virtual private networks under traffic uncertainty. Networks 49(1): 100-115 (2007) - [j30]Kürsad Derinkuyu, Mustafa Ç. Pinar, Ahmet Camci:
An improved probability bound for the Approximate S-Lemma. Oper. Res. Lett. 35(6): 743-746 (2007) - [j29]Mustafa Ç. Pinar:
Robust scenario optimization based on downside-risk measure for multi-period portfolio selection. OR Spectr. 29(2): 295-309 (2007) - 2006
- [j28]F. Aykut Özsoy, Mustafa Ç. Pinar:
An exact algorithm for the capacitated vertex p-center problem. Comput. Oper. Res. 33: 1420-1436 (2006) - [j27]Bülent Karasözen, Mustafa Ç. Pinar, Tamás Terlaky, Gerhard-Wilhelm Weber:
Feature Cluster "Advances in Continuous Optimization". Eur. J. Oper. Res. 169(3): 1077-1078 (2006) - [j26]Mustafa Ç. Pinar, Wolfgang M. Hartmann:
Huber approximation for the non-linear l. Eur. J. Oper. Res. 169(3): 1096-1107 (2006) - [j25]Kürsad Derinkuyu, Mustafa Ç. Pinar:
On the S-procedure and Some Variants. Math. Methods Oper. Res. 64(1): 55-77 (2006) - [j24]Mustafa Ç. Pinar, Marc Teboulle:
On semidefinite bounds for maximization of a non-convex quadratic objective over the l1 unit ball. RAIRO Oper. Res. 40(3): 253-265 (2006) - 2005
- [j23]Mustafa Ç. Pinar, Reha H. Tütüncü:
Robust profit opportunities in risky financial portfolios. Oper. Res. Lett. 33(4): 331-340 (2005) - 2004
- [j22]Mustafa Ç. Pinar:
A note on robust 0-1 optimization with uncertain cost coefficients. 4OR 2(4): 309-316 (2004) - [j21]Mustafa Ç. Pinar:
Finite Computation of the l1 Estimator from Huber's M-Estimator in Linear Regression. Computing 72(3-4): 365-384 (2004) - [j20]Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar:
Virtual Private Network Design Under Traffic Uncertainty. Electron. Notes Discret. Math. 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
- [j19]Mustafa Ç. Pinar:
A Derivation of Lovász' Theta via Augmented Lagrange Duality. RAIRO Oper. Res. 37(1): 17-27 (2003) - [j18]Aslihan Altay-Salih, Mustafa Ç. Pinar, Sven Leyffer:
Constrained Nonlinear Programming for Volatility Estimation with GARCH Models. SIAM Rev. 45(3): 485-503 (2003) - 2002
- [j17]Mustafa Ç. Pinar:
A global error bound for quadratic perturbation of linear programs. Appl. Math. Lett. 15(3): 367-370 (2002) - 2001
- [j16]Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar:
The robust spanning tree problem with interval data. Oper. Res. Lett. 29(1): 31-40 (2001) - 2000
- [j15]Mustafa Ç. Pinar:
A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications. Eur. J. Oper. Res. 124(1): 151-158 (2000) - [j14]Ü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)
1990 – 1999
- 1999
- [j13]Bintong Chen, Patrick T. Harker, Mustafa Ç. Pinar:
Continuation method for nonlinear complementarity problems via normal maps. Eur. J. Oper. Res. 116(3): 591-606 (1999) - [j12]Kaj Madsen, Hans Bruun Nielsen, Mustafa Ç. Pinar:
Bound constrained quadratic programming via piecewise quadratic functions. Math. Program. 85(1): 135-156 (1999) - 1998
- [j11]Mustafa Ç. Pinar:
Newton's method for linear inequality systems. Eur. J. Oper. Res. 107(3): 710-719 (1998) - [j10]Kaj Madsen, Hans Bruun Nielsen, Mustafa Ç. Pinar:
A Finite Continuation Algorithm for Bound Constrained Quadratic Programming. SIAM J. Optim. 9(1): 62-83 (1998) - 1996
- [j9]Mustafa Ç. Pinar:
Linear programming via a quadratic penalty function. Math. Methods Oper. Res. 44(3): 345-370 (1996) - [j8]Kaj Madsen, Hans Bruun Nielsen, Mustafa Ç. Pinar:
A New Finite Continuation Algorithm for Linear Programming. SIAM J. Optim. 6(3): 600-616 (1996) - [c2]Hakan Özaktas, Mustafa Akgül, Mustafa Ç. Pinar:
The Parallel Surrogate Constraint Approach to the Linear Feasibility Problem. PARA 1996: 565-574 - 1995
- [j7]Claus Bendtsen, Per Christian Hansen, Kaj Madsen, Hans Bruun Nielsen, Mustafa Ç. Pinar:
Implementation of QR Up- and Downdating on a Massively Parallel Computer. Parallel Comput. 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
- [j6]Kaj Madsen, Hans Bruun Nielsen, Mustafa Ç. Pinar:
New characterizations of ℓ1 solutions to overdetermined systems of linear equations. Oper. Res. Lett. 16(3): 159-166 (1994) - [j5]Mustafa Ç. Pinar, Stavros A. Zenios:
On Smoothing Exact Penalty Functions for Convex Constrained Optimization. SIAM J. Optim. 4(3): 486-511 (1994) - [j4]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
- [j3]Mustafa Ç. Pinar, Stavros A. Zenios:
A Comparative Study of Parallel Decompositions for Multicommodity Flow Problems. Parallel Algorithms Appl. 1(4): 255-271 (1993) - 1992
- [j2]Mustafa Ç. Pinar, Stavros A. Zenios:
Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm. INFORMS J. Comput. 4(3): 235-249 (1992) - [j1]Stavros A. Zenios, Mustafa Ç. Pinar:
Parallel Block-Partitioning of Truncated Newton for Nonlinear Network Optimization. SIAM J. Sci. Comput. 13(5): 1173-1193 (1992) - [p1]Mustafa Ç. Pinar, Stavros A. Zenios:
Naval personnel Assignment: an Application of linear-quadratic penalty Methods. Computer Science and Operations Research 1992: 43-58
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
