Melih Özlen
Orcid: 0000-0001-5902-1402
According to our database1,
Melih Özlen
authored at least 25 papers
between 2006 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
User-Preference Based Evolutionary Algorithms for Solving Multi-Objective Nonlinear Minimum Cost Flow Problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
2022
Comput. Oper. Res., 2022
A decomposition approach for the prioritised home health care problem with synchronised visits and multi-period planning.
Comput. Ind. Eng., 2022
2021
The bee-benders hybrid algorithm with application to transmission expansion planning.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021
2020
A genetic algorithm with local search for solving single-source single-sink nonlinear non-convex minimum cost flow problems.
Soft Comput., 2020
INFORMS J. Comput., 2020
Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions.
Appl. Soft Comput., 2020
2019
NSGA-II for Solving Multiobjective Integer Minimum Cost Flow Problem with Probabilistic Tree-Based Representation.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2019
2018
An Adaptive Large Neighbourhood Search for asset protection during escaped wildfires.
Comput. Oper. Res., 2018
A spatial optimisation model for fuel management to break the connectivity of high-risk regions while maintaining habitat quality.
Proceedings of the GEOSAFE Workshop on Robust Solutions for Fire Fighting, 2018
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018
2017
Ann. Oper. Res., 2017
2016
Cooperative coevolutionary differential evolution with improved augmented Lagrangian to solve constrained optimisation problems.
Inf. Sci., 2016
CoRR, 2016
2014
J. Optim. Theory Appl., 2014
2013
J. Glob. Optim., 2013
A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology.
Algorithmica, 2013
2012
Computing the Crosscap Number of a Knot Using Integer Programming and Normal Surfaces.
ACM Trans. Math. Softw., 2012
A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour
CoRR, 2012
2011
Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria.
J. Oper. Res. Soc., 2011
2009
Multi-objective integer programming: A general approach for generating all non-dominated solutions.
Eur. J. Oper. Res., 2009
2008
Comput. Oper. Res., 2008
2006
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.
PhD thesis, 2006