你的名字*：

你的机构*：

您的电子邮件地址*：

软件包名称*：

软件主页：

软件作者：（例如：马克·史密斯、安东·梅尔）

软件简介： <trans data-src="Minimum cost disjoint paths under arc dependences. ">弧依赖下的最小代价不相交路径。</trans><trans data-src="Algorithms for practice. ">用于实践的算法。</trans><trans data-src="In this thesis, we develop a unified algorithmic framework for Minimum Cost Disjoint Paths Problems. ">在这篇论文中，我们发展了一个统一的最小成本不相交路径问题的算法框架。</trans><trans data-src="These problems arise in a variety of applied contexts, in particular telecommunication networks and automated vehicle routing. ">这些问题出现在各种应用环境中，特别是电信网络和自动车辆路径选择。</trans><trans data-src="The main motivation typically is the desire to plan a structure which is safe in a certain way. ">主要动机通常是希望设计一个安全的结构。</trans><trans data-src="In telecommunications, survivability of networks is a paramount issue. ">在电信领域，网络的生存性是一个至关重要的问题。</trans><trans data-src="In guiding of cargo vehicles, it is prevention of collisions. ">在引导货运车辆时，它是为了防止碰撞。</trans><trans data-src="We have taken the initial impulse for our research from a project with T-Systems Darmstadt. ">我们从达姆施塔特T系统公司的一个项目中获得了初步的研究动力。</trans><trans data-src="Planners needed a tool to support the pricing of so-called Virtual Private Networks. ">规划者需要一种工具来支持所谓的虚拟专用网络的定价。</trans><trans data-src="We developed a software called ODEA to aid their processes. ">我们开发了一个名为ODEA的软件来帮助他们的流程。</trans><trans data-src="It was also applied to realistic instances from a logistics project with Containerterminal Altenwerder at Hamburg harbour. ">它还应用于汉堡港集装箱码头Altenwerder物流项目的实际案例。</trans><trans data-src="Disjoint Paths Problems are posed in the form of a directed or undirected graph with nonnegative arc/edge costs and a set of node pairs in it. ">不相交路径问题是以有向图或无向图的形式提出的，该图具有非负弧/边代价和一组节点对。</trans><trans data-src="A feasible solution is a set of connecting paths, one for each node pair, such that two conditions are satisfied: 1. ">一个可行的解决方案是一组连接路径，每个节点对一个，这样就满足两个条件：1。</trans><trans data-src="all paths are pairwise nonintersecting in a given sense, 2. ">在给定意义下，所有路径都是成对的非相交的，2。</trans><trans data-src="the total cost of the solution is a minimum among all solutions. ">解决方案的总成本是所有解决方案中最小的。</trans><trans data-src="This problem is known to be NP-hard even in very restricted cases. ">即使在非常有限的情况下，这个问题也是NP难的。</trans><trans data-src="Literature reports about special cases allowing polynomial time algorithms as well as heuristic approximation schemes. ">关于允许多项式时间算法以及启发式近似方案的特殊情况的文献报道。</trans><trans data-src="There is an apparent lack on exact approaches suitable for deployment in broad purpose software. ">显然缺乏适合在广泛用途软件中部署的准确方法。</trans><trans data-src="Our work addresses this gap. ">我们的工作解决了这一差距。</trans><trans data-src="We present an integer programming model flexible enough to accommodate several disjointness modes, yet practical enough to allow for efficient algorithmic treatment of real-world instances. ">我们提出了一个整数规划模型，它足够灵活，能够适应多种不相交的模式，但又足够实用，能够有效地对现实世界中的实例进行算法处理。</trans><trans data-src="We introduce a new modelling technique called arc dependences. ">我们介绍了一种新的建模技术，称为弧依赖。</trans><trans data-src="It generalizes the traditional notion of disjointness which differentiates between arc-, edge- or node disjointness only. ">它推广了传统的离散性概念，它只区分弧、边或节点不连续性。</trans><trans data-src="With its help, planners can restrict their work to specially constructed abstractions of the input graph, comprising significantly less data without losing the essence needed for safety. ">在它的帮助下，规划者可以将他们的工作限制在输入图的特别构造的抽象部分，包含的数据显著减少，而不会丢失安全所需的本质。</trans><trans data-src="While the main focus of this model lies on paths in the graph, we also investigate an alternative featuring so-called star flows. ">虽然这个模型的主要焦点在于图中的路径，但我们也研究了一种具有所谓星形流的替代方案。</trans><trans data-src="The main part of this book describes in detail the methods developed for encoding in our software. ">本书的主要部分详细描述了在我们的软件中为编码而开发的方法。</trans><trans data-src="We devise a Branch-and-Bound scheme and fill in the contents for its functional ingredients: branching strategies, structural pruning, upper and lower cost bounds. ">我们设计了一个分枝定界方案，并填写了其功能成分的内容：分枝策略、结构修剪、成本上下限。</trans><trans data-src="This includes two novel ideas for strengthening the latter. ">后者包括两个加强这方面的思想。</trans><trans data-src="Behind all these tasks, the combinatorial core engine of the solver is an assortment of specially adapted cheapest paths routines. ">在所有这些任务的背后，求解器的组合核心引擎是一系列经过特别调整的最便宜路径例程。</trans><trans data-src="We set up a representative testbed and perform extensive testing of our algorithms throughout all development stages. ">我们建立了一个具有代表性的测试平台，并在所有开发阶段对我们的算法进行了广泛的测试。</trans><trans data-src="We conclude with a competition between ODEA and the commercial general purpose CPLEX MIP solver.">最后，我们将在ODEA和商用通用CPLEX MIP解算器之间展开竞争。</trans>

引用描述软件的已发表文章：
（例如，对于GAP：“GAP 4型系统组织代数算法”，Zbl 0918.68050）

描述软件的关键词：（例如：格氏基、有限元法、偏微分方程等）

适用领域：（如：教育、金融、工程等）

对其他软件的依赖性：（例如：Maple、Matlab等）

当前版本：（例如：1.2）

许可条款：（例如：GPL、商业等）

编程语言：（如：Java、C++、Python等）

操作系统：（例如：Linux、Windows XP等）

接口：（例如：Gnuplot export、C library等）

评论： <trans data-src="Update software ODEA: http://swmath.org/software/7671">更新软件ODEA:http://swmath.org/software/7671</trans>

SOI-软件对象标识符（DOI）：

SVOI-软件版本对象id:

你自己抄送？