Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:ojs2.ojs.uofg.edu.sd:article/2151

Approximation algorithms for solving multi-objective optimization problems

Authors
Publication date
17 October 2022
Publisher
Deanship of Scientific Research, University of Gezira

Abstract

This paper tries to cover the main aspects/properties related to scheduling problems, approximation algorithms, and multi-objective combinatorial optimization. Then, we try to describe the main techniques that can be used to solve such problems. In this paper, the reviews results relate to multi-objective optimization problems, exact and approximation search, with the aim of getting all Pareto optimal solutions for some NP-hard problems

Similar works

Full text

thumbnail-image

Journals Of University Of Gezira

redirect
oaioai:ojs2.ojs.uofg.edu.sd:artic...
Last time updated on 18/10/2022

This paper was published in Journals Of University Of Gezira.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.