default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMelih Özlen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Behrooz Ghasemishabankareh
, Xiaodong Li, Melih Ozlen:
User-Preference Based Evolutionary Algorithms for Solving Multi-Objective Nonlinear Minimum Cost Flow Problems. GECCO 2024- 2022
- [j15]Dian Nuraiman, Melih Ozlen:
A decomposition approach for the prioritised home health care problem with synchronised visits and multi-period planning. Comput. Ind. Eng. 174: 108722 (2022) - [j14]Dian Nuraiman, Melih Ozlen, John Hearne:
A decomposition approach for the stochastic asset protection problem. Comput. Oper. Res. 138: 105591 (2022) - 2021
- [c5]Cameron A. G. MacRae, Melih Ozlen, Andreas T. Ernst:
The bee-benders hybrid algorithm with application to transmission expansion planning. GECCO Companion 2021: 1275-1282 - 2020
- [j13]Behrooz Ghasemishabankareh, Xiaodong Li, Melih Ozlen, Frank Neumann:
Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions. Appl. Soft Comput. 86 (2020) - [j12]William Pettersson, Melih Ozlen:
Multiobjective Integer Programming: Synergistic Parallel Approaches. INFORMS J. Comput. 32(2): 461-472 (2020) - [j11]Behrooz Ghasemishabankareh, Melih Ozlen, Xiaodong Li, Kalyanmoy Deb:
A genetic algorithm with local search for solving single-source single-sink nonlinear non-convex minimum cost flow problems. Soft Comput. 24(2): 1153-1169 (2020)
2010 – 2019
- 2019
- [c4]Behrooz Ghasemishabankareh, Melih Ozlen, Xiaodong Li:
NSGA-II for Solving Multiobjective Integer Minimum Cost Flow Problem with Probabilistic Tree-Based Representation. EMO 2019: 541-552 - [i6]William Pettersson, Melih Ozlen:
Multi-Objective Mixed Integer Programming: An Objective Space Algorithm. CoRR abs/1909.03829 (2019) - 2018
- [j10]Iman Roozbeh, Melih Ozlen, John W. Hearne:
An Adaptive Large Neighbourhood Search for asset protection during escaped wildfires. Comput. Oper. Res. 97: 125-134 (2018) - [c3]Behrooz Ghasemishabankareh, Melih Ozlen, Frank Neumann, Xiaodong Li:
A Probabilistic Tree-Based Representation for Non-convex Minimum Cost Flow Problems. PPSN (1) 2018: 69-81 - [c2]Javier León, Victor M. J. J. Reijnders, John W. Hearne, Melih Ozlen, Karin J. Reinke:
A spatial optimisation model for fuel management to break the connectivity of high-risk regions while maintaining habitat quality. RSFF 2018: 8-17 - 2017
- [j9]Martijn van der Merwe, Melih Ozlen, John W. Hearne, James P. Minas:
Dynamic rerouting of vehicles during cooperative wildfire response operations. Ann. Oper. Res. 254(1-2): 467-480 (2017) - [i5]William Pettersson, Melih Ozlen:
A parallel approach to bi-objective integer programming. CoRR abs/1701.08920 (2017) - 2016
- [j8]Behrooz Ghasemishabankareh, Xiaodong Li, Melih Ozlen:
Cooperative coevolutionary differential evolution with improved augmented Lagrangian to solve constrained optimisation problems. Inf. Sci. 369: 441-456 (2016) - [i4]Iman Roozbeh, Melih Ozlen, John W. Hearne:
A heuristic scheme for the Cooperative Team Orienteering Problem with Time Windows. CoRR abs/1608.05485 (2016) - 2014
- [j7]Melih Ozlen, Benjamin A. Burton, Cameron A. G. MacRae:
Multi-Objective Integer Programming: An Improved Recursive Algorithm. J. Optim. Theory Appl. 160(2): 470-482 (2014) - 2013
- [j6]Benjamin A. Burton, Melih Ozlen:
A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology. Algorithmica 65(4): 772-801 (2013) - [j5]Melih Ozlen, Meral Azizoglu, Benjamin A. Burton:
Optimising a nonlinear utility function in multi-objective integer programming. J. Glob. Optim. 56(1): 93-102 (2013) - 2012
- [j4]Benjamin A. Burton, Melih Ozlen:
Computing the Crosscap Number of a Knot Using Integer Programming and Normal Surfaces. ACM Trans. Math. Softw. 39(1): 4:1-4:18 (2012) - [i3]Benjamin A. Burton, Melih Ozlen:
A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour. CoRR abs/1211.1079 (2012) - 2011
- [j3]Melih Özlen, Meral Azizoglu:
Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria. J. Oper. Res. Soc. 62(1): 152-164 (2011) - [c1]Benjamin A. Burton, Melih Ozlen:
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology. SCG 2011: 145-152 - [i2]Benjamin A. Burton, Melih Ozlen:
Computing the crosscap number of a knot using integer programming and normal surfaces. CoRR abs/1107.2382 (2011) - 2010
- [i1]Benjamin A. Burton, Melih Ozlen:
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology. CoRR abs/1010.6200 (2010)
2000 – 2009
- 2009
- [j2]Melih Özlen, Meral Azizoglu:
Multi-objective integer programming: A general approach for generating all non-dominated solutions. Eur. J. Oper. Res. 199(1): 25-35 (2009) - 2008
- [j1]Deniz Türsel Eliiyi, Melih Özlen:
A Lagrangean relaxation approach for the mixed-model flow line sequencing problem. Comput. Oper. Res. 35(3): 933-943 (2008) - 2006
- [b1]Melih Özlen:
A bicriteria rescheduling problem on unrelated parallel machines: network flow and enumeration based approaches ; İlgisiz paralel makinalarda iki kriterli yeniden çizelgeleme problemi: ağ akış ve birerleme tabanlı yaklaşımlar. Middle East Technical University, Çankaya, Ankara, Turkey, 2006
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 2025-01-21 00:05 CET 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:
