𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Network flow analysis algorithms

✍ Scribed by Luke G. Latham II

Book ID
113577238
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
446 KB
Volume
192
Category
Article
ISSN
0304-3800

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Network flow analysis
Network flow analysis
✍ Bruce Potter πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 89 KB
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