نتایج جستجو برای: Bound Constraint

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

Journal: :journal of mining and environment 2015
mohammad rezaie ali moradzadeh ali nejati kalate

one of the most remarkable basis of the gravity data inversion is the recognition of sharp boundaries between an ore body and its host rocks during the interpretation step. therefore, in this work, it is attempted to develop an inversion approach to determine a 3d density distribution that produces a given gravity anomaly. the subsurface model consists of a 3d rectangular prisms of known sizes ...

Inversion of magnetic data is an important step towards interpretation of the practical data. Smooth inversion is a common technique for the inversion of data. Physical bound constraint can improve the solution to the magnetic inverse problem. However, how to introduce the bound constraint into the inversion procedure is important. Imposing bound constraint makes the magnetic data inversion a n...

Journal: :EURO Journal on Computational Optimization 2013

Journal: :مدیریت صنعتی 0
بهروز دری دانشیار گروه مدیریت صنعتی دانشکدۀ مدیریت و حسابداری، دانشگاه شهید بهشتی، تهران، ایران بهرنگ اسدی دانشجوی دکتری مالی دانشکدۀ مدیریت، دانشگاه تهران، تهران، ایران ساسان مظاهری دانشجوی دکتری مدیریت صنعتی دانشکدة مدیریت، دانشگاه تهران، تهران، ایران

a vast number of organizational projects as well as complexity of decision making process can cause particular challenges for project management and its leadership. in order to use organization assets and opportunities efficiently, it is necessary that manager implement a comprehensive multidimensional project portfolio management system that considers economic, social and technical details of ...

2007
Pierre Schaus Yves Deville Pierre Dupont

Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean is rational. We introduce bound-consistent propagators running in linear time with respect to the number of variables. We evaluate the improvement in terms of efficiency and pruning obtained with the new propagators ...

1996
Pierre Dago Gérard Verfaillie

In the frame of classical Constraint Satisfaction Problems (CSPs), the backtrack tree search, combined with learning methods, presents a double advantage : for static solving, it improves the search speed by avoiding redundant explorations; for dynamic solving (after a slight change of the problem), it reuses the previous searches to build a new solution quickly. Backtrack reasoning concludes t...

Journal: :journal of industrial engineering, international 2010
h javanshir s.r seyedalizadeh ganji

yard crane is an important resource in container terminals. efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. this paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is nphard in nature. in other words, one of the most important constraints in...

Journal: :Journal of Banking and Finance 2023

• A shadow rate that measures the monetary policy stance in any lower-bound environment Shadow rates are estimated for US, Sweden, euro area and UK They fall (rise) as becomes more expansionary (contractionary) Exchange respond to conventional than unconventional Counterfactuals DSGE models suggest US Swedish policies had macro effects during their entire periods We propose a without lower boun...

2003
Stefano Bistarelli Philippe Codognet Kin Chuen Hui Jimmy Ho-Man Lee

We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-based constraint satisfaction problems (SCSPs), we define constraint hierarchy k-consistency (CH-k-C) and give a CH-2-C enforcement algorithm. We demonstrate how the CH-2-C algorithm can be seamlessly integrated into the...

2013
Anuj Agrawal

Constraint programming is the study of system which is based on constraints. The solution of a constraint satisfaction problem is a set of variable value assignments, which satisfies all members of the set of constraints in the CSP. In this paper the application of constraint satisfaction programming is used in predicting the path loss of various indoor propagation models using chronological ba...

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

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