Download:
|
by Holly Sue Zullo, Harvey Greenberg, Jennifer Ryan, David Fisher, J. Richard Lundgren, Gary Kochenberger
http://www-math.cudenver.edu/graduate/thesis/hzullo.ps.gz
Add To MetaCart
Abstract:
Thesis directed by Professor Harvey Greenberg This thesis establishes the minimal representation of the necessary conditions for feasible supplies and demands for a given multicommodity network. The fundamental theorem is an extension of the WallaceWets connectivity result for both directed and undirected graphs. A system of absolute value inequalities is developed for the undirected case, and special properties of this system are explored. Additional results include counting the number of nonredundant inequalities for specific classes of graphs. This abstract accurately represents the content of the candidate's thesis. I recommend its publication. Signed Harvey Greenberg
Citations
|
66
|
Integer Programming and Network Flows
– Hu
- 1969
|
|
66
|
Multicommodity flows in planar graphs
– Okamura, Seymour
- 1981
|
|
64
|
Planar Graphs: Theory and Algorithms
– Nishizeki, Chiba
- 1988
|
|
34
|
On an Extension of the Maximum-flow Minimum-cut Theorem to Multicommodity Flows
– Iri
- 1971
|
|
27
|
Matroids and Multicommodity Flows
– Seymour
- 1981
|
|
23
|
Some Recent Applications of the Theory of Linear Inequalities to Extremal Combinational Analysis
– Hoffman
- 1960
|
|
18
|
On two commodity network flows
– Rothschild, Whinston
- 1966
|
|
17
|
A Survey of Linear Cost Multicommodity Network Flows
– Kennington
- 1978
|
|
13
|
A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
– Farvolden, Powell, et al.
- 1993
|
|
13
|
On odd cuts and plane multicommodity flows
– Seymour
- 1981
|
|
12
|
Scaling algorithms for multicommodity flow problems and network flow problems with side constraints
– Schneur
- 1991
|
|
5
|
Evolutionary trees: an integer multicommodity max-flow–min-cut theorem
– Erdős, Székely
- 1992
|
|
5
|
Minimum-cost multicommodity network flows
– Tomlin
- 1966
|
|
4
|
On Max-flow Min-cut and Integral Flow Properties for Multicommodity Flows in Directed Networks
– Nagamochi, Ibaraki
- 1989
|
|
4
|
Preprocessing in stochastic programming: The case of capacitated networks
– Wallace, Wets
- 1995
|
|
3
|
Multicommodity Network Flows
– Assad
- 1978
|
|
3
|
Relaxation Methods for the Strictly Convex Multicommodity Flow Problem with Capacity Constraints on Individual Commodities
– Nagamochi, Fukushima, et al.
- 1990
|
|
3
|
Integer Plane Multiflows with a Fixed Number of Demands
– Sebo
- 1993
|
|
3
|
Preprocessing in stochastic programming: the case of uncapacitated networks
– Wallace, Wets
- 1989
|
|
2
|
A Theorem on Flows
– Gale
- 1957
|
|
2
|
Studies on multicommodity flows in directed networks, Eng
– Nagamochi
- 1988
|
|
2
|
Two Commodity Flows
– Rajagopalan
- 1994
|
|
2
|
Two Commodity Network Flows and
– Sakarovitch
- 1973
|
|
2
|
Dual Integrality and multicommodity flows, in Infinite and Finite Sets
– Sebo
- 1987
|
|
1
|
Networks, Frames, Blocking Systems
– Fulkerson
- 1968
|
|
1
|
Feasibility in Capacitated Networks: The effect of individual arcs and nodes
– Ghannadan, Wallace
- 1994
|
|
1
|
Max-Flow Min-Cut Theorem for the Multicommodity Flows
– Nagamochi, Ibaraki
- 1989
|
|
1
|
Multicommodity Flow Problem
– Shevchik
- 1993
|
|
1
|
The Stochastic Multicommodity Flow Problem
– Soroush, Mirchandi
- 1990
|
|
1
|
Multicommodity Networks with Resource Constraints : The Generalized Multicommodity Flow Problem
– Wollmer
- 1972
|
