default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSerpil Sayin
Person information
- affiliation: Koç University, Istanbul, Turkey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i2]Richard Allmendinger, Carlos M. Fonseca, Serpil Sayin, Margaret M. Wiecek, Michael Stiglmayr:
Multiobjective Optimization on a Budget (Dagstuhl Seminar 23361). Dagstuhl Reports 13(9): 1-68 (2023)- 2022
- [j26]Karl-Heinz Küfer, Kaisa Miettinen
, Stefan Ruzika, Serpil Sayin:
Multi-criteria optimization in industry. OR Spectr. 44(2): 303-305 (2022) - 2021
- [j25]Kaisa Miettinen, Serpil Sayin:
Preface of the special issue on global multiobjective optimization. J. Glob. Optim. 80(1): 1-2 (2021)
2010 – 2019
- 2018
- [j24]Gokhan Kirlik, Serpil Sayin:
Bilevel programming for generating discrete representations in multiobjective optimization. Math. Program. 169(2): 585-604 (2018) - 2015
- [j23]Gokhan Kirlik, Serpil Sayin:
Computing the nadir point for multiobjective discrete optimization problems. J. Glob. Optim. 62(1): 79-99 (2015) - 2014
- [j22]Aysegül Askan, Serpil Sayin:
SVM classification for imbalanced data sets using a multiobjective optimization framework. Ann. Oper. Res. 216(1): 191-203 (2014) - [j21]Gokhan Kirlik, Serpil Sayin:
A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur. J. Oper. Res. 232(3): 479-488 (2014) - 2013
- [j20]Kaisa Miettinen, Serpil Sayin:
Special Issue: 21st International Conference on Multiple Criteria Decision Making; Articles on multiobjective optimization. J. Glob. Optim. 57(2): 279-280 (2013) - 2012
- [j19]Haldun Aytug, Serpil Sayin:
Exploring the trade-off between generalization and empirical errors in a one-norm SVM. Eur. J. Oper. Res. 218(3): 667-675 (2012)
2000 – 2009
- 2009
- [j18]Haldun Aytug, Serpil Sayin:
Using support vector machines to learn the efficient set in multiple objective discrete optimization. Eur. J. Oper. Res. 193(2): 510-519 (2009) - [j17]Özden Gür Ali, Serpil Sayin, Tom Van Woensel, Jan Fransoo:
SKU demand forecasting in the presence of promotions. Expert Syst. Appl. 36(10): 12340-12348 (2009) - [j16]Can Yildirmaz, Selçuk Karabati, Serpil Sayin:
Pricing and lot-sizing decisions in a two-echelon system with transportation costs. OR Spectr. 31(3): 629 (2009) - [r1]Serpil Sayin:
Multi-objective Optimization and Decision Support Systems. Encyclopedia of Optimization 2009: 2460-2465 - [i1]José Rui Figueira, Martin Geiger, Salvatore Greco, Johannes Jahn, Kathrin Klamroth, Masahiro Inuiguchi, Vincent Mousseau, Serpil Sayin, Roman Slowinski, Margaret M. Wiecek, Katrin Witting:
09041 Working Group on MCDM for Robust Multiobjective Optimization (1st Round). Hybrid and Robust Approaches to Multiobjective Optimization 2009 - 2008
- [j15]Selçuk Karabati, Serpil Sayin:
Single-supplier/multiple-buyer supply chain coordination: Incorporating buyers' expectations under vertical information sharing. Eur. J. Oper. Res. 187(3): 746-764 (2008) - 2007
- [j14]Serpil Sayin, Selçuk Karabati:
Assigning cross-trained workers to departments: A two-stage optimization model to maximize utility and skill improvement. Eur. J. Oper. Res. 176(3): 1643-1658 (2007) - 2006
- [j13]Panagiotis Kouvelis, Serpil Sayin:
Algorithm robust for the bicriteria discrete optimization problem. Ann. Oper. Res. 147(1): 71-85 (2006) - [j12]Burcu Saglam, F. Sibel Salman, Serpil Sayin, Metin Türkay:
A mixed-integer programming approach to the clustering problem with an application in customer segmentation. Eur. J. Oper. Res. 173(3): 866-879 (2006) - 2005
- [j11]Serpil Sayin, Panos Kouvelis:
The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm. Manag. Sci. 51(10): 1572-1581 (2005) - 2003
- [j10]Serpil Sayin:
Kaisa M. Miettinen Nonlinear Multiobjective Optimization Kluwer Academic Publishers, 1999 ISBN 0-7923-8278-1, 320 pages. Eur. J. Oper. Res. 148(1): 229-230 (2003) - [j9]Selçuk Karabati, Serpil Sayin:
Assembly line balancing in a mixed-model sequencing environment with synchronous transfers. Eur. J. Oper. Res. 149(2): 417-429 (2003) - [j8]Serpil Sayin:
A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors. Oper. Res. 51(3): 427-436 (2003) - 2000
- [j7]Serpil Sayin:
Optimizing Over the Efficient Set Using a Top-Down Search of Faces. Oper. Res. 48(1): 65-72 (2000) - [j6]Serpil Sayin:
A mixed integer programming formulation for the 1-maximin problem. J. Oper. Res. Soc. 51(3): 371-375 (2000) - [j5]Serpil Sayin:
Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Math. Program. 87(3): 543-560 (2000)
1990 – 1999
- 1999
- [j4]Serpil Sayin, Selçuk Karabati:
A bicriteria approach to the two-machine flow shop scheduling problem. Eur. J. Oper. Res. 113(2): 435-449 (1999) - 1998
- [j3]Meltem Denizel, Serpil Sayin:
Part-type selection in flexible manufacturing systems: a bicriteria approach with due dates. J. Oper. Res. Soc. 49(6): 659-669 (1998) - 1996
- [j2]Serpil Sayin:
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming. Oper. Res. Lett. 19(2): 87-94 (1996) - 1994
- [j1]Harold P. Benson, Serpil Sayin:
A finite concave minimization algorithm using branch and bound and neighbor generation. J. Glob. Optim. 5(1): 1-14 (1994)
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-05-08 21:01 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:
