نتایج جستجو برای: min time problem
تعداد نتایج: 2666431 فیلتر نتایج به سال:
The biproportional apportionment problem (BAP) must be faced in many proportional electoral systems where seats must be allocated to parties within regions. BAP is a non trivial optimization problem, and only sophisticated algorithms are currently available for solving it. The issue is: are they “writable” as an actual law? Citizens rightly demand simple, easy to understand, voting systems. The...
markov chain anticipation for the online traveling salesman problem by simulated annealing algorithm
the arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. the policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. in on-line created tours arc costs are not available for decision makers. the on-line traversed nodes are f...
The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard ...
the purpose of this study was the relationship between problem – solvi ability with fdi cognitive style of students.the research method was correlation method. for data analysis pearson test was used. statistical society in this research was all the students of alligoodarz city in 1391-92 year.to sampling of statiscal population was used sampling multi-stage random the size of sample selected 2...
background: metabolic syndrome (ms) is emerging as a serious public health problem in korea. the purpose of this study was to examine the effects of 12 weeks of combined exercise training on body composition and ms factors in obese korean female college students. methods: subjects were randomly assigned to exercise (n = 7) and control (n = 9) groups. the exercise group trained for 80 min/day, f...
The following optimization problem is studied. There are several sets of integer positive numbers whose values are uncertain. The problem is to select one representative of each set such that the sum of the selected numbers is minimum. The uncertainty is modeled by discrete and interval scenarios, and the min–max and min–max (relative) regret approaches are used for making a selection decision....
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید