نتایج جستجو برای: online decision problem

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

Journal: :global analysis and discrete mathematics 0
gholam hassan shirdel department of mathematics, faculty of basic science, university of qom, qom, iran mohsen abdolhosseinzadeh department of mathematics, faculty of basic science, university of qom, qom, iran

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...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت مدرس - دانشکده فنی مهندسی 1388

the purpose of this study is identifying effective factors which make customers shop online in iran and investigating the importance of discovered factors in online customers’ decision. in the identifying phase, to discover the factors affecting online shopping behavior of customers in iran, the derived reference model summarizing antecedents of online shopping proposed by change et al. was us...

طبرسا, غلامعلی, گیلانی, نیما,

In this thesis “the relationship between information systems (IS) and decision making process of private bank middle managers” on the aspect of decisions effectiveness enhancement is surveyed.The independent variable of this research is information systems that consists of TPS, MIS, DSS, GDSS and SIS. Decision making process could be affected from several aspects by information systems.Some imp...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

Journal: :international journal of information science and management 0
te-king chien department of information management, national formosa university, yunlin, taiwan hon-yu ma ten-in food co., ltd, business division chiayi, taiwan ya-chi kao department of information management, national formosa university, yunlin, taiwan

although many scholars had proposed lots research results about online shopping, they are quite vague and hard for enterprisers to practice it. hence, this research observes the online store policies, services, functions, and activities among 17 online shopping platforms in taiwan, china, and hong kong. and, this research (1) finds online stores assessment items by literature review; (2) establ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شاهد - دانشکده فنی و مهندسی 1387

abstract biometric access control is an automatic system that intelligently provides the access of special actions to predefined individuals. it may use one or more unique features of humans, like fingerprint, iris, gesture, 2d and 3d face images. 2d face image is one of the important features with useful and reliable information for recognition of individuals and systems based on this ...

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...

Journal: :journal of algorithms and computation 0
e. r. swart kelowna, british columbia, canada stephen j. gismondi university of guelph, canada n. r. swart university of british columbia okanagan, canada c. e. bell guelph, ontario, canada a. lee university of guelph, canada

we present a matching and lp based heuristic algorithm that decides graph non-hamiltonicity. each of the n! hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices p, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. a graph instance (g) is initially coded as exclusion set ...

Journal: :Journal of Industrial and Management Optimization 2021

The bank clearing problem (BCP) refers to the of designing an optimal algorithm for interbank payment system. Due way in which system has evolved, classical BCP model is insufficient addressing this accurately. In particular, delayed settlements are allowed now popular high-frequency deferred net settlement (DNS) practice, characteristics incoming instructions heavily connected time day, and ca...

Journal: :Sinkron : jurnal dan penelitian teknik informatika 2022

Online business has increased during the COVID-19 pandemic, but emergence of a number problems, namely reduced material supply, price fluctuations because an item is difficult to distribute and slow delivery due transportation goods based on type used (Trucks, Trains, Airplanes Ships). declines virus resulting in longer order waiting times. Pick-up Delivery Issues are variations Vehicle Routing...

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

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