نتایج جستجو برای: ε constraint approach
تعداد نتایج: 1361973 فیلتر نتایج به سال:
This paper describes an exact ε-constraint method for bi-objective combinatorial optimization problems with integer objective values. This method tackles multi-objective optimization problems by solving a series of single objective subproblems, where all but one objective are transformed into constraints. We show in this paper that the Pareto front of bi-objective problems can be efficiently ge...
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergraphs, certain constraint satisfaction problems, maximum-entropy sampling, and maximum facility-location problems. Our main result is that for any k ≥ 2 and any ε > 0, there is a natural local-search algorithm which has...
The maximin share guarantee is, in the context of allocating indivisible goods to a set of agents, a recent fairness criterion. A solution achieving a constant approximation of this guarantee always exists and can be computed in polynomial time. We extend the problem to the case where the goods collectively received by the agents satisfy a matroidal constraint. Polynomial approximation algorith...
In this paper, a hybrid method for solving multi-objective problem has been provided. The proposed method is combining the ε-Constraint and the Cuckoo algorithm. First the multi objective problem transfers into a single-objective problem using ε-Constraint, then the Cuckoo optimization algorithm will optimize the problem in each task. At last the optimized Pareto frontier will be drawn. The adv...
We introduce a tactical resource allocation model for large aerospace engine system manufacturer aimed at long-term production planning. Our identifies the routings product takes through factory, and which machines should be qualified balanced loading, to reduce lead times. prove some important mathematical properties of that are used develop heuristic providing good initial feasible solution. ...
due to extraordinary large amount of information and daily sharp increasing claimant for ui benefits and because of serious constraint of financial barriers, the importance of handling fraud detection in order to discover, control and predict fraudulent claims is inevitable. we use the most appropriate data mining methodology, methods, techniques and tools to extract knowledge or insights from ...
In this paper we consider the minimization of a positive semidefinite quadratic form, having a singular corresponding matrix $H$. We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method. Given this approach and based on t...
Problem frames are patterns for analyzing, structuring, and characterizing software development problems. This paper presents a formal metamodel for problem frames expressed in UML class diagrams and using the formal specification notation OCL. That metamodel clarifies the nature of the different syntactical elements of problem frames, as well as the relations between them. It provides a framew...
introduction: several techniques are used to evaluate decision making units in dmus with a restricted multiplier. dea is recognized as a methodology widely used to evaluate the relative efficiency of a set of decision-making units (dmus) involved in a production process. this approach assumes that the input and output data of the different decision making units (dmus) are measured with precisio...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید