𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A faster polynomial algorithm for the constrained maximum flow problem

✍ Scribed by Cenk Çalışkan

Book ID
113553833
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
447 KB
Volume
39
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A capacity scaling algorithm for the con
A capacity scaling algorithm for the constrained maximum flow problem
✍ Ravindra K. Ahuja; James B. Orlin 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 970 KB

## Abstract The constrained maximum flow problem is to send the maximum possible flow from a source node s to a sink node t in a directed network subject to a budget constraint that the cost of flow is no more than __D__. In this paper, we consider two versions of this problem: (i) when the cost of

A faster polynomial algorithm for the un
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
✍ Ulrich Brenner 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 320 KB

We present a new algorithm for the Hitchcock transportation problem. On instances with n sources and k sinks, our algorithm has a worst-case running time of O(nk 2 (log n + k log k)). It closes a gap between algorithms with running time linear in n but exponential in k and a polynomialtime algorithm

A polynomial algorithm for a constrained
A polynomial algorithm for a constrained traveling salesman problem
✍ J.H. Rubinstein; D.A. Thomas; N.C. Wormald 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB

## Abstract We give a polynomial‐time algorithm for finding a solution to the Traveling Salesman Problem when the points given are constrained to lie on a fixed set of smooth curves of finite length. © 2001 John Wiley & Sons, Inc.