John J. Jarvis

According to our database, John J. Jarvis authored at least 11 papers between 1970 and 1990.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

1990

Hierarchical solution of network flow problems.

Anant H. V. Lyer, John J. Jarvis, H. Donald Ratliff

Networks, 1990

1982

A decomposition algorithm for locating a shortest path between two nodes in a network.

John J. Jarvis, Süleyman Tüfekci

Networks, 1982

Decomposition algorithms for locating minimal cuts in a network.

John J. Jarvis, Süleyman Tüfekci

Math. Program., 1982

1981

Set partitioning based heuristics for interactive routing.

Frank H. Cullen, John J. Jarvis, H. Donald Ratliff

Networks, 1981

1978

Network topology and integral multicommodity flow problems.

James R. Evans, John J. Jarvis

Networks, 1978

Optimal Design of Regional Wastewater Systems: A Fixed-Charge Network Flow Model.

John J. Jarvis, Ronald L. Rardin, V. E. Unger, Richard W. Moore, Charles C. Schimpeler

Oper. Res., 1978

1977

Graphic matroids and the multicommodity transportation problem.

James R. Evans, John J. Jarvis, Richard A. Duke

Math. Program., 1977

An out-of-kilter based heuristic for the integer multicommodity transportation problem.

James R. Evans, John J. Jarvis

Comput. Oper. Res., 1977

1973

Technical Note - Maximal Funnel-Node Flow in an Undirected Network.

John J. Jarvis, Duane D. Miller

Oper. Res., 1973

1972

Maximal Flow with Gains through a Special Network.

John J. Jarvis, Anthony M. Jezior

Oper. Res., 1972

1970

Generalized Penalty-Function Concepts in Mathematical Optimization.

Mandell Bellmore, Harvey J. Greenberg, John J. Jarvis

Oper. Res., 1970