نتایج جستجو برای: constraints

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

2009
George Katsirelos Toby Walsh

Symmetry is an important feature of many combinatorial search problems. We propose a new method for dynamically posting static symmetry breaking constraints during search. This method is based on the observations that any symmetry of a set of symmetry breaking constraints can be used to break symmetry, and different symmetries pick out different solutions. We choose which symmetry to post as br...

2012
Jimmy Ho-Man Lee Jingying Li

Breaking the exponential number of all symmetries of a constraint satisfaction problem is too costly. In practice, we often aim at breaking a subset of the symmetries efficiently, which we call target symmetries. In static symmetry breaking, the goal is to post a set of constraints to break these target symmetries in order to reduce the solution set and thus also the search space. Symmetries of...

Journal: :CoRR 2012
Ankur A. Kulkarni Uday V. Shanbhag

Multi-leader multi-follower games are a class of hierarchical games in which a collection of leaders compete in a Nash game constrained by the equilibrium conditions of another Nash game amongst the followers. Much of the extant research on this topic is either model specific or relies on weaker notions of equilibria. We observe that when this original game is modified to ensure that the leader...

2009
Yuichiro Kamada Fuhito Kojima Takuo Sugaya

A probabilistic voting model with voter utility functions that are not necessarily concave is examined. When voters are polarized, there is a convexity threshold of their utility function below which policy convergence is a unique equilibrium, and above which policy divergence is a unique equilibrium. Divergent equilibrium is more likely when voters become more polarized. Social welfare is maxi...

1998
Michael Patriksson

We propose a systematic means for achieving a set of overall traac management or planning goals with respect to the performance of the traac network through the use of link tolls. The primary goals are deened by a set of link ow restrictions. The tolls that achieve these goals are obtained by solving a generalization of the classical user equilibrium model which includes a set of side constrain...

The present study examined the impact of financial development on the investment of the companies listed on the Tehran Stock Exchange. To achieve this goal, data gathered from 258 companies during 2005 to 2016 and the dynamic generalized method of moments were utilized to formulate the investment model with financial constraints. The results of the study showed that these companies faced financ...

ژورنال: محاسبات نرم 2013
باشی زاده, رامین , حسن زاده, مریم,

University course timetabling problem is a complicated problem and finding a computer-aided solution for it was a subject to work for many years. To solve this problem, we must assign courses to timeslots with respect to hard and soft constraints. Hard constraints are those which must be necessarily met (some of them could be neglected with high costs). Our aim is to meet as many soft constrain...

In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...

The theory of constraints is an approach to production planning and control that emphasizes on the constraints to increase throughput by effectively managing constraint resources. One application in theory of constraints is product mix decision. Product mix influences the performance measures in multi-product manufacturing system. This paper presents an alternative approach by using of goal pro...

Journal: :مهندسی صنایع 0
علی اکبر اسلامی‏بلده مهندسی صنایع- دانشگاه صنعتی امیر کبیر میرمهدی سیداصفهانی دانشکده مهندسی صنایع -دانشگاه صنعتی امیرکبیر محمدعلی فارسی پژوهشکده سامانه‏های فضانوردی-پژوهشگاه فضایی ایران

the redundancy allocation problem can be described as selecting the components and system configuration in order to optimize some objective function(s) without violating the system constraints. operating conditions are not constant in many advanced engineering systems. mostly, in the engineering applications selection, the number of redundancy components must be balanced among the constraints (...

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

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