UID:
almahu_9947363030002882
Format:
256 p.
,
online resource.
ISBN:
9783642009235
Series Statement:
Mathematical Programming Studies, 26
Note:
Algorithms for maximum network flow -- Threshold assignment algorithm -- Shortest path methods: A unifying approach -- On a nonbasic dual method for the transportation problem -- An efficient implementation of the network simplex method -- Tailoring Benders decomposition for uncapacitated network design -- An algorithm for the Rural Postman problem on a directed graph -- Nonlinear cost network models in transportation analysis -- Variations on the integral decomposition property -- A short note on matching algorithms -- Common aspects of several network flow algorithms -- Finding all optimal solutions to the network flow problem -- A heuristic procedure for calculating telecommunication transmission networks in consideration of network reliability -- A linear programming approach to the optimum network orientation problem -- Computational comparison of two solution procedures for allocation/processing networks -- Advanced start for the multicommodity network flow problem -- A class of network design problems with multiple demand: Model formulation and an algorithmic approach -- Some experience in applying a stochastic method to location problems -- A new heuristic for determining fleet size and composition -- Solving integer minimum cost flows with separable convex cost objective polynomially -- A motivation for using the truncated Newton approach in a very large scale nonlinear network problem -- The performance of NLPNET, a large-scale nonlinear network optimizer -- Vehicle routing and scheduling with time windows -- A game-theoretic approach to network equilibrium.
In:
Springer eBooks
Additional Edition:
Printed edition: ISBN 9783642009228
Language:
English
URL:
http://dx.doi.org/10.1007/BFb0121084
Bookmarklink
