𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving a combinatorial problem with network flows

✍ Scribed by Florin Manea; Cąlina Ploscaru

Book ID
105662873
Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
162 KB
Volume
17
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Solving a Network Design Problem
Solving a Network Design Problem
✍ Alain Chabrier; Emilie Danna; Claude Le Pape; Laurent Perron 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 153 KB
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.

Solving inequality constrained combinato
Solving inequality constrained combinatorial optimization problems by the hopfield neural networks
✍ Shigeo Abe; Junzo Kawakami; Kotaroo Hirasawa 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 543 KB

The Hop.fteld neural networks are ~:~tended to handle inequality constraints where linear combinations of variables are lower-or upper-bounded. Then b)' eigenvahw analysis, the effects q/'the inequality constraints are analyzed and the lbllowing results are obtained" (a) f a combinatorial solution o