نتایج جستجو برای: فروشنده دورهگرد نامتقارن atsp
تعداد نتایج: 3302 فیلتر نتایج به سال:
The asymmetric traveling salesman problem with time windows (ATSP-TW) is a basic model for scheduling and routing applications. In this paper, we present a formulation of the problem involving only 0/1 variables associated with the arcs of the underlying digraph. This has the advantage of avoiding additional variables as well as the associated (typically very ineffective) linking constraints. I...
این پژوهش به بررسی مفاهیم اعتماد و تعهد در دو سطح خرده فروشی (شامل دو سطح، فروشنده و فروشگاه) و همچنین تأثیر ایندو متغیر بر کیفیت ارتباط می پردازد. بر اساس بازنگری های به عمل آمده، مدلی نظری پیشنهاد شده است که بین اعتماد و تعهد ازیک سو و کیفیت ارتباط از سوی دیگر رابطه برقرار می کند. متغیرهای اصلی این تحقیق عبارتند از: اعتماد مشتری به فروشنده، اعتمادمشتری به فروشگاه، تعهد مشتری به فروشنده، تعهد ...
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions. In this paper, we introduce a linear search strategy which we refer to as cut-and-solve and prove optimality and completeness for this method. At each node in the search path, a relaxed problem and a sparse problem are solved and a constraint is added to the relaxed problem. The sparse problems provide incumbent...
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem (ATSP). There are currently three general classes of such heuristics: classical tour construction heuristics such as Nearest Neighbor and the Greedy algorithm, local search algorithms based on rearranging segments of the t...
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem (ATSP). There are currently three general classes of such heuristics: classical tour construction heuristics such as Nearest Neighbor and the Greedy algorithm, local search algorithms based on rearranging segments of the t...
Gutin et al. [G. Gutin, A. Yeo, Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number, Discrete Applied Mathematics 119 (1–2) (2002) 107–116] proved that, in the ATSP problem, a tour of weight not exceeding the weight of an average tour is of dominance ratio at least 1/(n − 1) for all n 6= 6. (Tours with this property can be easily obtained.) In [N. Alon...
Optimized reviewer assignment can effectively utilize limited intellectual resources and significantly assure review quality in various scenarios such as paper selection in conference or journal, proposal selection in funding agencies and so on. However, little research on reviewer assignment of software peer review has been found. In this study, an optimization approach is proposed based on st...
Polynomially testable characterization of cost matrices associated with a complete digraph on n nodes such that all the Hamiltonian cycles (tours) have the same cost is well known. Tarasov [25] obtained a characterization of cost matrices where tour costs take two distinct values. We provide a simple alternative characterization of such cost matrices that can be tested in O(n) time. We also pro...
The Asymmetric Traveling Salesperson Path (ATSPP) problem is one where, given an asymmetric metric space (V, d) with specified vertices s and t, the goal is to find an s-t path of minimum length that visits all the vertices in V . This problem is closely related to the Asymmetric TSP (ATSP) problem, which seeks to find a tour (instead of an s-t path) visiting all the nodes: for ATSP, a ρ-approx...
فروشندگان از طریق ایجاد تعهد و اعتماد در مشتری، بهبود رضایتمندی و نهایتاً ایجاد وفاداری در آنها نقش بسیار مهمی در موفقیت و ماندگاری یک صنعت بازی میکنند. این متغیر در ارتباط با محصولات درگیرکننده و اغلب غیرخوراکی نقشی پر رنگتر دارد و شناخت آن دسته از ویژگی هایی که یک فروشنده میبایست از نظر مشتریان حائز آن باشد، اهمیتی بالا دارد. پژوهش حاضر با همین هدف به شناسایی و طبقه بندی ویژگیهای فروشند...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید