Results 191 to 200 of about 8,257 (239)

A machine learning algorithm to predict treatment effectiveness for Kawasaki disease in China: a retrospective model development and validation study. [PDF]

Front Immunol
Li X, Zhou Z, Fan J, Zhao L, Xu R, Li D, Ma X, Sun L, Wu Y, Wang Z, Wang C.   +10 more
europepmc   +1 more source

Identification and experimental validation of aging-related biomarkers in intervertebral disc degeneration. [PDF]

Sci Rep
Zhang F, Yuan L, Ding H, Lou Z, Li X.
europepmc   +1 more source

Validation of Synthetic Megavoltage Computed Tomography (MVCT) for Dose Calculation in Radiotherapy Treatment Planning. [PDF]

Cancers (Basel)
Corso A, Martinel N, Rehman M, Stancanello J, Micheloni C, Deana C, Cappelletto C, Chiovati P, Spizzo R, Fanetti G, Dassie A, Avanzo M.   +11 more
europepmc   +1 more source

A Hypergraph Network Simplex Algorithm

Operations Research Proceedings: Papers of the Annual Meeting = Vorträge Der Jahrestagung / DGOR, 2018
We describe a network simplex algorithm for the minimum cost flow problem on graph-based hypergraphs which are directed hypergraphs of a particular form occurring in railway rotation planning. The algorithm is based on work of Cambini, Gallo, and Scutella who developed a hypergraphic generalization of the network simplex algorithm, see Cambini et al ...
Beckenbach, Isabel
exaly   +3 more sources

A new strongly polynomial dual network simplex algorithm

Mathematical Programming, 1997
This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. The algorithm works directly on the original capacitated network and runs in O(mn(m + n log n) log n) time for the network with n nodes and m arcs. This complexity is better than the complexity of Orlin, Plotkin and Tardos' (1993) dual network simplex ...
Zhiying Jin
exaly   +4 more sources

A primal–dual simplex algorithm for bi-objective network flow problems

4or, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Augusto Eusebio, JOSÉ Rui Figueira, Matthias Ehrgott   +2 more
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

The Scaling Network Simplex Algorithm

Operations Research, 1992
In this paper, we present a new primal simplex pivot rule and analyze the worst case complexity of the resulting simplex algorithm for the minimum cost flow, the assignment, and the shortest path problems. We consider networks with n nodes, m arcs, integral arc capacities bounded by an integer number U, and integral arc costs whose magnitudes are ...
Ravindra K Ahuja, James B Orlin
exaly   +3 more sources

A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network

INFORMS Journal on Computing, 2013
A network simplex algorithm is described for the minimum-cost network flow problem on a generalized network, with the additional constraint that there exist sets of arcs that must carry equal amounts of flow. This problem can be modeled as a linear programming problem and solved using the standard simplex algorithm.
David R. Morrison, Jason J. Sauppe, Sheldon H. Jacobson   +2 more
openaire   +2 more sources

A dynamic version for the Network Simplex Algorithm

Applied Soft Computing Journal, 2014
We present a dynamic version for the Network Simplex Algorithm, which is called Dynamic Network Simplex Algorithm (DNSA).The overall approach of DNSA is to update the graph model dynamically and repair its spanning tree.To test the algorithm and its performance, an application of Automated Guided Vehicles in container terminals is used.The results show
Hassan Rashidi
exaly   +2 more sources