A New Algorithm for Solving a Special Matching Problem with a General Form Value Function under Constraints


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

We consider the assignment problem with a special structure with a general form value function and constraints prohibiting certain matchings. In this case, the matching cost may be undefined until some permutation is found. We formulate the problem in terms of graph theory and reduce it to finding a minimal cost path in a graph with nonlocal edge weights. The proposed method for solving the problem is a modification of the Dijkstra’s shortest path algorithm in a weighted directed graph. This research is motivated by well drilling applications. We also show the analysis of our numerical experiments.

作者简介

D. Uzhegov

MIPhT Engineering Center for Hard to Recover Minerals

编辑信件的主要联系方式.
Email: denis.uzhegov@phystech.edu
俄罗斯联邦, Moscow

A. Anan’ev

MIPhT Engineering Center for Hard to Recover Minerals

Email: denis.uzhegov@phystech.edu
俄罗斯联邦, Moscow

P. Lomovitskii

MIPhT Engineering Center for Hard to Recover Minerals

Email: denis.uzhegov@phystech.edu
俄罗斯联邦, Moscow

A. Khlyupin

MIPhT Engineering Center for Hard to Recover Minerals

Email: denis.uzhegov@phystech.edu
俄罗斯联邦, Moscow

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Inc., 2019