The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “An extension of the MS pivoting rule to capacitated network flow problems”

On nonlinear replicated networks.

Laureano F. Escudero (1985)

Qüestiió

Similarity:

In this paper we describe a new type of network flow problem that basically consists of the classical transshipment problem with the following extensions: (1) The replication of a network by producing subnetworks with identical structure, such that they are linked by so-called linking arcs; (2) The objective function terms related to the linking arcs are nondifferentiable nonlinear functions. We also describe an implementation of a linearly constrained nonlinear programming algorithm...

On optimizing a maximin nonlinear function subject to replicated quasi-arborescence-like constraints.

Laureano F. Escudero (1985)

Trabajos de Estadística e Investigación Operativa

Similarity:

In this paper we present the motivation for using the Truncated Newton method in an algorithm that maximises a non-linear function with additional maximin-like arguments subject to a network-like linear system of constraints. The special structure of the network (so-termed replicated quasi-arborescence) allows to introduce the new concept of independent superbasic sets and, then, using second-order information about the objective function without too much computer effort and storage. ...

Ratio rewards in networks

V. Aggarwal, Y. P. Aneja, K. P. K. Nair (1981)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The inverse maximum flow problem considering norm

Adrian Deaconu (2008)

RAIRO - Operations Research

Similarity:

The problem is to modify the capacities of the arcs from a network so that a given feasible flow becomes a maximum flow and the maximum change of the capacities on arcs is minimum. A very fast ⋅log()) time complexity algorithm for solving this problem is presented, where is the number of arcs and is the number of nodes of the network. The case when both, lower and upper bounds of the flow can be modified so that the given feasible flow becomes a maximum flow is also discussed. The...