运筹学和管理学研究协会
期刊
会议
图书
作者:Claudia Archetti , Natashia Boland , M. Grazia Speranza
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (3)INFORMS
摘要:We consider the inventory routing problem, in which a supplier has to replenish a set of customers by means of a limited fleet of capacitated vehicles over a discrete time horizon. The goal is to minimize the total cost of the distribution that comprises the inventory cost at the...
作者:Ibrahim Muter , Tevfik Aytekin
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (3)INFORMS
摘要:The success of a recommender system is generally evaluated with respect to the accuracy of recommendations. However, recently diversity of recommendations has also become an important aspect in evaluating recommender systems. One dimension of diversity is called aggregate diversi...
作者:Fatemeh Saberian , Archis Ghate , Minsun Kim
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (3)INFORMS
摘要:We present a spatiotemporally integrated formulation of the optimal fractionation problem using the standard log-linear-quadratic survival model. Our objective is to choose a fluence map and a number of fractions to maximize the biological effect of tumor dose averaged over ...
作者:Shaokun Fan , Xin Li , J. Leon Zhao
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (3)INFORMS
摘要:It is well documented in management literature that characteristics of collaboration processes strongly influence team performance in a business environment. However, little work has been done on how specific collaboration process patterns affect teamwork performance, leading to ...
作者:Andrea Bettinelli , Valentina Cacchiani , Enrico Malaguti
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (3)INFORMS
摘要:We study the knapsack problem with conflict graph (KPCG), an extension of the 0-1 knapsack problem, in which a conflict graph describing incompatibilities between items is given. The goal of the KPCG is to select the maximum profit set of compatible items while satisfying the kna...
作者:Caleb C. Fast , Illya V. Hicks
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (3)INFORMS
摘要:In this paper, we use a branch decomposition technique to improve approximations to the p -median problem. Starting from a support graph produced either by a combination of heuristics or by linear programming, we use dynamic programming guided by a branch decomposition of that su...
作者:Meghana Deodhar , Joydeep Ghosh , Maytal Saar-Tsechansky ...
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (3)INFORMS
摘要:Oftentimes businesses face the challenge of requiring costly information to improve the accuracy of prediction tasks. One notable example is obtaining informative customer feedback (e.g., customer-product ratings via costly incentives) to improve the effectiveness of recomme...
作者:Diego Pecin , Claudio Contardo , Guy Desaulniers ...
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (3)INFORMS
摘要:The vehicle routing problem with time windows (VRPTW) consists of finding least-cost vehicle routes to satisfy the demands of customers that can be visited within specific time windows. We introduce two enhancements for the exact solution of the VRPTW by branch-price-and-cut (BPC...
作者:Tao Wu , Kerem Akartunalı , Raf Jans ...
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (3)INFORMS
摘要:The coupled lot-sizing and cutting-stock problem has been a challenging and significant problem for industry, and has therefore received sustained research attention. The quality of the solution is a major determinant of cost performance in related production and inventory m...
作者:Ricardo Fukasawa , Laurent Poirrier
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (3)INFORMS
摘要:The resolution of integer programming problems is typically performed via branch and bound. Nodes of the branch-and-bound tree are pruned whenever the corresponding subproblem is proven not to contain a solution better than the best solution found so far. This is a key ingredient...

我们正在为您处理中,这可能需要一些时间,请稍等。

资源合作:cnki.scholar@cnki.net, +86-10-82896619   意见反馈:scholar@cnki.net

×