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

An algorithm for solving quadratic network flow problems

โœ Scribed by N. Boland; C.J. Goh; A.I. Mees

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
333 KB
Volume
4
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

An Algorithm for Solving Boundary Value
An Algorithm for Solving Boundary Value Problems
โœ Elias Deeba; S.A. Khuri; Shishen Xie ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 83 KB

In this paper a numerical algorithm, based on the decomposition technique, is presented for solving a class of nonlinear boundary value problems. The method is implemented for well-known examples, including Troesch's and Bratu's problems which have been extensively studied. The scheme is shown to be

An algorithm for solving the obstacle pr
An algorithm for solving the obstacle problems
โœ Lian Xue; Xiao-Liang Cheng ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 365 KB

ln this paper, we propose an algorithm for solving the obstacle problem. We try to find the approximated region of the contact in the obstacle problem by iteration. Numerical examples are given for the obstacle problem for a membrane and the elastic-plastic torsion problem. (~) 2004 Elsevier Ltd. Al

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