✦ LIBER ✦

Efficient solutions for the bicriteria network flow problem

✍ Scribed by P.Simin Pulat; Fenghueih Huarng; Haijune Lee

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 669 KB
Volume: 19
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(92)90034-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bicriteria network flow problems: Intege

Bicriteria network flow problems: Integer case

✍ Haijune Lee; P. Simin Pulat 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 632 KB

Hierarchical solution of network flow pr

Hierarchical solution of network flow problems

✍ Anant H. V. Lyer; John J. Jarvis; H. Donald Ratliff 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 954 KB

## Abstract Given a network flow problem and a partition of its nodes into disjoint sets, we provide an aggregation‐disaggregation procedure that reformulates the problem as the union of network flow subproblems. Each subproblem either involves nodes in a set and their induced arcs or involves node

A computationally efficient method for n

A computationally efficient method for nonlinear multicommodity network flow problems

✍ Lin, Shin-Yeu; Lin, Ch'i-Hsin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB 👁 2 views

In this paper, we present a new method for solving nonlinear multicommodity network flow problems with convex objective functions. This method combines a well-known projected Jacobi method and a new dual projected pseudo-quasi-Newton (DPPQN) method which solves multicommodity flow quadratic subprobl

Finding integer efficient solutions for

Finding integer efficient solutions for multiple objective network programming problems

✍ Minghe Sun 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 406 KB

Heuristic solutions for general concave

Heuristic solutions for general concave minimum cost network flow problems

✍ Dalila B.M.M. Fontes; José Fernando Gonçalves 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

## Abstract We address the single‐source uncapacitated minimum cost network flow problem with general concave cost functions. Exact methods to solve this class of problems in their full generality are only able to address small to medium size instances, since this class of problems is known to be N

EFFICIENT ANALYTIC SERIES SOLUTIONS FOR

EFFICIENT ANALYTIC SERIES SOLUTIONS FOR TWO–DIMENSIONAL POTENTIAL FLOW PROBLEMS

✍ A. W. GILL; W. W. READ 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 869 KB

The solution of Laplace's equation for a wide range of spatial domains and boundary conditions is a valuable asset in the study of potential theory. Recently, classical analytic series techniques based on separation of variables have been modified to solve Laplace's equation with both irregular and