نتایج جستجو برای: covering tour problem

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

Journal: :Bulletin of the American Mathematical Society 2022

The Connes embedding problem (CEP) is a in the theory of tracial von Neumann algebras and asks whether or not every algebra embeds into an ultrapower hyperfinite II 1 <mml:annotation encoding="application/x-...

2016
Kwan Hui Lim Jeffrey Chan Christopher Leckie Shanika Karunasekera

Recommending and planning tour itineraries are challenging and time-consuming for tourists, hence they may seek tour operators for help. Traditionally tour operators have offered standard tour packages of popular locations, but these packages may not cater to tourist’s interests. In addition, tourists may want to travel in a group, e.g., extended family, and want an operator to help them. We in...

Journal: :Mathematical and Computer Modelling 2004

Hamideh Nikzad Jafar Bagherinejad Mahdi Bashiri

Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...

Journal: :Mathematical Research Letters 2015

Journal: :International Transactions in Operational Research 2002

Journal: :Computers & Operations Research 2022

In this article, we consider the set covering problem with conflict constraints, i.e., from each conflicting pair of columns at most one column can appear in feasible solution. For problem, propose appropriate pre-processing techniques and several families Valid Inequalities (VIs) for corresponding integer programming model that result simultaneous presence constraints stable (conflict) constra...

Journal: :European Journal of Combinatorics 1985

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

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