نتایج جستجو برای: constraint model

تعداد نتایج: 2157921  

Journal: :Theory and Practice of Logic Programming 2017

This paper considers a bi-objective mathematical model for locations of landfills, transfer stations and material recovery facilities (MRFs) in order to serve the entire regions and simultaneously identify the capacities of landfills. This is a mixed-integer programming (MIP) model, whose objectives are to minimize the total cost and pollution simultaneously. To validate the model, a numerical ...

Journal: :Journal of Object Technology 2006
László Lengyel Tihamer Levendovszky Hassan Charaf

Model transformation has become one of the most focused research field, motivated by for instance the OMG’s Model-Driven Architecture (MDA). Metamodeling is a central technique in the design of visual languages, and it reuses existing domains by extending the metamodel level. Metamodel-based software development requires the transformation of the models between various stages. These transformat...

The haplotype inference is one of the most important issues in the field of bioinformatics. It is because of its various applications in the diagnosis and treatment of inherited diseases such as diabetes, Alzheimer's and heart disease, which has provided a competition for researchers in presentation of mathematical models and design of algorithms to solve this problem. Despite the existence of ...

Journal: :international journal of environmental research 2010
h.h. zhang y.n. zeng l. bian

in this study, under the constraint of resource-saving and environment-friendliness objective, based on multi-agent genetic algorithm, multi-objective spatial optimization (moso) model for land use allocation was developed from the view of simulating the biological autonomous adaptability to environment and the competitive-cooperative relationship. the model was applied to solve the practical m...

2009
Ákos Horváth Dániel Varró

Constraint satisfaction programming (CSP) has been successfully used in model-driven development (MDD) for solving a wide range of (combinatorial) problems. In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction pr...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید