default search action
Özgür Özpeynirci
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Özge Büyükdeveci, Selin Özpeynirci
, Özgür Özpeynirci
Multi-objective shipment consolidation and dispatching problem. Comput. Oper. Res. 169: 106728 (2024) - 2023
- [j17]Özgür Özpeynirci
A decomposition based minimax regret approach for inverse multiple criteria sorting problem. 4OR 21(1): 125-149 (2023) - [j16]Baybars Ibroska
Multiple traveling salesperson problem with drones: General variable neighborhood search approach. Comput. Oper. Res. 160: 106390 (2023) - 2022
- [j15]Selin Özpeynirci
Portfolio decision analysis with a generalized balance approach. Comput. Oper. Res. 142: 105705 (2022) - [j14]Sinem Tokcaer
Designing an optimal contract mechanism in a cellulosic biofuel enterprise. Optim. Lett. 16(3): 845-875 (2022) - 2021
- [j13]Selin Özpeynirci
An interactive algorithm for resource allocation with balance concerns. OR Spectr. 43(4): 983-1005 (2021)
2010 – 2019
- 2018
- [j12]Vincent Mousseau
Inverse multiple criteria sorting problem. Ann. Oper. Res. 267(1-2): 379-412 (2018) - [j11]Selin Özpeynirci
An interactive algorithm for multiple criteria constrained sorting problem. Ann. Oper. Res. 267(1-2): 447-466 (2018) - 2017
- [j10]Özgür Özpeynirci, Selin Özpeynirci
An interactive approach for multiple criteria selection problem. Comput. Oper. Res. 78: 154-162 (2017) - [j9]Özgür Özpeynirci:
On nadir points of multiobjective integer programming problems. J. Glob. Optim. 69(3): 699-712 (2017) - 2016
- [j8]Gökhan Ceyhan
A branch and price algorithm for the pharmacy duty scheduling problem. Comput. Oper. Res. 72: 175-182 (2016) - [j7]Özgür Özpeynirci, Ebru Aglamaz:
Pharmacy duty scheduling problem. Int. Trans. Oper. Res. 23(3): 459-480 (2016) - 2015
- [j6]Özgür Özpeynirci, Cansu Kandemir
A Pseudo-Polynomial Time Algorithm for a Special Multiobjective Order Picking Problem. Int. J. Inf. Technol. Decis. Mak. 14(5): 1111-1128 (2015) - 2014
- [j5]Fatih Kocatürk
Variable neighborhood search for the pharmacy duty scheduling problem. Comput. Oper. Res. 51: 218-226 (2014) - 2010
- [j4]Murat Köksalan, Tayyar Büyükbasaran, Özgür Özpeynirci, Jyrki Wallenius:
A flexible approach to ranking with an application to MBA Programs. Eur. J. Oper. Res. 201(2): 470-476 (2010) - [j3]Özgür Özpeynirci, Murat Köksalan:
Pyramidal tours and multiple objectives. J. Glob. Optim. 48(4): 569-582 (2010) - [j2]Özgür Özpeynirci, Murat Köksalan:
An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs. Manag. Sci. 56(12): 2302-2315 (2010)
2000 – 2009
- 2009
- [j1]Özgür Özpeynirci, Murat Köksalan:
Multiobjective traveling salesperson problem on Halin graphs. Eur. J. Oper. Res. 196(1): 155-161 (2009)
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-07 22:24 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: