An improved version of the augmented ε-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems
G Mavrotas, K Florios - Applied Mathematics and Computation, 2013 - Elsevier
Generation (or a posteriori) methods in Multi-Objective Mathematical Programming (MOMP)
is the most computationally demanding category among the MOMP approaches. Due to the …
is the most computationally demanding category among the MOMP approaches. Due to the …
Finding all nondominated points of multi-objective integer programs
B Lokman, M Köksalan - Journal of Global Optimization, 2013 - Springer
We develop exact algorithms for multi-objective integer programming (MIP) problems. The
algorithms iteratively generate nondominated points and exclude the regions that are …
algorithms iteratively generate nondominated points and exclude the regions that are …
Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
M Köksalan, B Lokman - Naval Research Logistics (NRL), 2009 - Wiley Online Library
Finding all nondominated vectors for multi‐objective combinatorial optimization (MOCO)
problems is computationally very hard in general. We approximate the nondominated …
problems is computationally very hard in general. We approximate the nondominated …
Multiobjective combinatorial optimization: some approaches
M Köksalan - Journal of Multi‐Criteria Decision Analysis, 2008 - Wiley Online Library
There have been many developments in multiple criteria decision‐making (MCDM) during
the last 50 years. Researchers from different areas have also recognized the multiple …
the last 50 years. Researchers from different areas have also recognized the multiple …
Models and approaches to multiobjective arc tour problems with an application to marathon course design
M Basdere - 2018 - search.proquest.com
Marathons are long distance running events with many participants, often organized in
heavily populated cities. A key component in marathon planning operations is the design of …
heavily populated cities. A key component in marathon planning operations is the design of …
Converging preferred regions in multi-objective combinatorial optimization problems
B Lokman - 2011 - open.metu.edu.tr
Finding the true nondominated points is typically hard for Multi-objective Combinatorial
Optimization (MOCO) problems. Furthermore, it is not practical to generate all of them since …
Optimization (MOCO) problems. Furthermore, it is not practical to generate all of them since …