๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Greedy concepts for network flow problems

โœ Scribed by Wolfgang W. Bein; Peter Brucker

Book ID
104182981
Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
333 KB
Volume
15
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Problems of network flow
Problems of network flow
โœ William Prager ๐Ÿ“‚ Article ๐Ÿ“… 1965 ๐Ÿ› Springer ๐ŸŒ English โš– 302 KB
A note on the greedy algorithm for the u
A note on the greedy algorithm for the unsplittable flow problem
โœ Petr Kolman ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 161 KB

In a recent paper Chekuri and Khanna improved the analysis of the greedy algorithm for the edge disjoint paths problem and proved the same bounds also for the related uniform capacity unsplittable flow problem. Here we show that their ideas can be used to get the same approximation ratio even for th

Combinatorial algorithms for inverse net
Combinatorial algorithms for inverse network flow problems
โœ Ravindra K. Ahuja; James B. Orlin ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 122 KB

An inverse optimization problem is defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x 0 สฆ S. We want to perturb the cost vector c to d so that x 0 is an optimal solution of P with respect to the cost vector d, and wสˆd

An algorithm for solving quadratic netwo
An algorithm for solving quadratic network flow problems
โœ N. Boland; C.J. Goh; A.I. Mees ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 333 KB

We describe a new algorithm for solving separable quadratic cost network programming problems and compare its performance with that of the convex simplex method for networks.