Netflow at Pisa

Algorithms for maximum network flow....Pages 1-11
Threshold assignment algorithm....Pages 12-37
Shortest path methods: A unifying approach....Pages 38-64
On a nonbasic dual method for the transportation problem....Pages 65-82
An efficient implementation of the network simplex method....Pages 83-111
Tailoring Benders decomposition for uncapacitated network design....Pages 112-154
An algorithm for the Rural Postman problem on a directed graph....Pages 155-166
Nonlinear cost network models in transportation analysis....Pages 167-196
Variations on the integral decomposition property....Pages 197-199
A short note on matching algorithms....Pages 200-204
Common aspects of several network flow algorithms....Pages 205-208
Finding all optimal solutions to the network flow problem....Pages 209-212
A heuristic procedure for calculating telecommunication transmission networks in consideration of network reliability....Pages 213-214
A linear programming approach to the optimum network orientation problem....Pages 215-217
Computational comparison of two solution procedures for allocation/processing networks....Pages 218-220
Advanced start for the multicommodity network flow problem....Pages 221-224
A class of network design problems with multiple demand: Model formulation and an algorithmic approach....Pages 225-228
Some experience in applying a stochastic method to location problems....Pages 229-232
A new heuristic for determining fleet size and composition....Pages 233-236
Solving integer minimum cost flows with separable convex cost objective polynomially....Pages 237-239
A motivation for using the truncated Newton approach in a very large scale nonlinear network problem....Pages 240-244
The performance of NLPNET, a large-scale nonlinear network optimizer....Pages 245-248
Vehicle routing and scheduling with time windows....Pages 249-251
A game-theoretic approach to network equilibrium....Pages 252-255